a. Draw the binary min heap that emerges from sequentially inserting the elements 11, 9, 12, 14, 3, 15, 7, 8, 1 into an initially empty binary heap. Illustrate the intermediate results as you insert each element, and provide the array representation of the final heap.

b. Write a pseudocode function that transforms a min heap (stored in an array) to a max heap. Store the result in the same array. No return values are expected. Please justify the correctness of your function.