Figure 5.6: Example of a heap storing 13 integer keys. The last node is the one storing key 8, and external nodes are empty. 1. Show the steps for removing key 16 from the heap of Figure 5.6. 2. Show the steps for replacing 5 with 18 in the heap of Figure 5.6.