Show the splay tree that result from the insertion of the following numbers into an initially empty tree 1 -2 -3 -4 -5 -6 -7 Show the splay tree that results from a search (1) operation on the splay tree from question 16. Based upon the resultant trees from questions 15-17, what conclusions can you draw regarding the self-adjusting nature of a splay tree versus a binary search tree Show the binary heap that results from the insertion of the following numbers into an initially empty heap: 35 - 20 - 30 - 50 - 45 - 60 - 18 - 25 - 42 Show the binary heap that results from a remove () operation performed on the heap in question 19. Draw the heap from question 20 as an array