Heap Consider the following min-oriented binary heap. 10 8 11 12 The questions in this section ask you to draw the heap after some operations have been performed In order to "draw" the heap, simply enter the numbers in level-order: from top to bottom, left to right, one level per line. For example, the original heap can be written as follows: 1 5 10 96 7 11 12 Question 6 (6 points) Draw the heap which results after one call to the delete-the-min operation. (Start with the original heap given at the top of this section, ignoring any other questions.)