Problem
(a) Design a function that will insert a new entry into a heap, obtaining a new heap. (The function insert_heap in the text requires that the root be unoccupied, whereas, for this exercise, the root will already contain the entry with largest key, which must remain in the heap. Your function will increase the count of entries in the list.)
(b) Analyze the time and space requirements of your function.