CODING IN C++

Min Heap Given the data set stored in an array: p- [32,43, 77,3, 7, 12,8], we consider the following process. Let H be a min heap initially set to be empty. We add the elements in the array p one-by-one to the min heap H. Draw the final resulting tree after all the elements are added . (Continue from the above.) Perform the extract min algorithm to get rid of the min element You should describe the step-by-step procedure. (Recall that you need to maintain the structure of "full binary tree".) (Continue from the above.) After the previous step, add a new node 1 to the heap. Describe the step-by-step procedure. (Continue from the above.) After the previous step, add a new node 11 to the heap. Describe the step-by-step procedure