5.In the following questions, consider the list of numbers: 62, 31, 70, 91, 25, 11, 9, 61, 73, 6.

(A)Show the result of inserting the numbers in the list in the same order specified above into an initially empty minimum heap. Note that you need to show how the heap looks like after each number is inserted.

(B)Show the result of inserting the numbers in the list in the same order specified above into an initially empty binary search tree. Note that you need to show how the binary search tree looks like after each number is inserted.

(C)Use the binary search tree you created in question 2. What are the two possible binary search trees after 62 is deleted?

(D)Explain how you can utilize a minimum heap to sort the list of numbers in descending order. Let n be the number of elements in the list. What is the time complexity of your sorting algorithm