nsider the following max-heap. 8 marks] 0 a) Draw the heap that results after inserting the key Z b) Draw the heap that results after deleting the maximum key from your answer to (a). Trucbr false: given any binary heap with N distinct keys, the result of inserting a key larger than any of the N keys, and then deleting the maximum key yields the original binary heap