Problem 1. (25 points) For each of the following lists, construct an AVL tree by inserting their elements successively. starting with the empty tree. a) 1,2,3,4,5,6 b) 6,5,4,3,2,1