Insert key 63 into the following Max-heap, then delete key 70. Use your final result to answer the following questions (a) What is the index of the node containing key 60 in the resulting tree? (b)...

Insert key 63 into the following Max-heap, then delete key 70. Use your final result to answer the following questions

(a) What is the index of the node containing key 60 in the resulting tree?

(b)  List the leaves from left-to-right in the resulting tree?

Note: The root is considered to have index 0.

Extracted text: 70 60 40 30 20 10 Max heap 50