Starting with the following binary search tree, draw a new tree representation after each (you should have 6 drawings) of the following method calls, which should be treated as cumulative. tree.put(2): tree.put(13): tree.remove(7): tree.put(3): tree.put(34): tree.remove(22): Starting with the following AVL tree, draw a new tree representation after each (you should have 3 drawings) of the following method calls, which should be treated as cumulative. tree.put (33): tree.remove(4): tree.put(17)