C 20 30 40 51 on 8 60 70 80 9 10 11 12 13 14 elete the minimum key (3) from the following Min-heap and use your final result to answer the following questions 3 5 15 13 10 17 19 25 Click HERE to display the tree if it does not show (a) What is the index of the node containing key 25 in the resulting tree? (b) How many nodes are in the last level of the resulting tree? (c) Write down the leaf nodes of the resulting tree from left to right Note: The root is considered to have index 0 For the toolbar, press ALT+F10 (PC) or ALT+ 3 (12pt) TTT Arial F10 (Mac) CS Scanned with CamScanner