Assume that you are implementing a heap using a fixed size array. Illustrate how the following heap would be constructed (show the content of the array, show in detail only what happens when nodes 8 and 13 are added): The nodes are inserted in the following order (key, value): (17, $-4), (11,-6),(3,-4), (9,-7), (7,-2), (6,-8),(8,-5),(13,-7), (12,-3)$. 2- Illustrate what happens to the heap when invoking remove. CS.VS. 1116