Starting with an empty Binary Search Tree, insert the following sequence of elements in the tree with no rebalancing. What is the inorder traversal of the tree 25,40,15,50,60,10,20,45,30 A. 10,20,15,30,45,60,50,40,25 B. 25,40,15,50,60,10,20,45,30 C. 10,15,20,25,30,40,45,50,60 D. 25,15,10,20,40,30,50,45,60 QUESTION 22 Show the heap in the form of an array (MinHeap - the root has minimum value) that would be used to store the numbers 15,25,10,33,55,47,82,90,18, assuming they are inserted in that sequence. A. [10,15,18,25,33,47,55,82,90] B. [15,25,10,33,55,47,82,90,18] C. [90,82,55,47,33,25,18,15,10] D. [10,18,15,25,55,47,82,90,33] Show the new heap in the form of an array after removing the minimum number from the above heap in previous question. A. [15,18,25,33,47,55,82,90] B. [90,82,55,47,33,25,18,15] C. [18,15,25,55,47,82,90,33] D. [15,18,33,25,55,47,82,90 Represent the following graph using adjacency lists