1. a) Insert the following 12 values into an initially empty 2-3 tree (insert them in this exact You only need to show the tree after all insertions, not the tree after each insertion b) Insert the same 12 values into an initially empty 2-3 tree, only insert them in ascending order order): 3, 5,7, 1,2, 4, 6, 10, 9, 8, 12, 11 this time: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 Again, you only need to show the tree after all insertions. c) Finally, insert these same 12 values into a BST in ascending order (in the same order you inserted them into the 2-3 tree in part b): 1,2, 3,4, 5, 6, 7, 8,9,10, 11, 12 d) How many key comparisons does it take to NOT find the value 13 within the 2-3 tree in part b? How many key comparisons does it take to NOT find the value 13 within the BST in part c