This question is about heap. a. Suppose array S = [10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, 2]. Show the result of a min-heap after heaplifying the array S. b. Suppose 0 is inserted to the...

This question is about heap.
a. Suppose array S = [10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, 2]. Show the result of a min-heap after heaplifying the array S.
b. Suppose 0 is inserted to the result of (a). Show the result of the min-heap after insertion.
c. Suppose the root of the min-heap in (b) is removed twice. Show the result after each deletion.