Question 10 Build a minimum heap with these items inserted in the designated order: [ 53, 25, 21, 44, 66, 52, 18, 39, 97, 51, 32, 42 } Clearly indicate the finished heap as an array (inside a pair of [ ], with the elements separated by commas), with items in the proper locations. Alternatively, you can use slashes (/ V) to depict the heap in tree form if you prefer. Edit View Insert Format Tools Table 12pt > Paragraph ~ | B I Y A ~ & T V | 0 - B BV | Q S | = EV EV| TO BB 1 0 words Question 11 Show the heap from the previous question after a call to remove_min(. Clearly indicate the finished heap as an array (inside a pair of [ ], with the elements separated by commas), with items in the proper locations. Alternatively, you can use slashes (/ V) to depict the heap in tree form if you prefer