Problem 2 (BST insertion and rotation, 20 points) Given 5,3,7,2,4,6,1), show how to insert them sequentially into a BST and maintain the balanced property through rotation when necessary. Does your result achieve the minimum tree height (i.e., the optimal balancing property)? If not, what will the optimally balanced BST look like