1. Repeat Checkpoint Question 10, but instead use the array 9, 12, 4, 8, 3, 11, 6, 15. 2. Prove that the root of a max heap contains the largest value in the tree. 3. Does the order in which you...

1. Repeat Checkpoint Question 10, but instead use the array 9, 12, 4, 8, 3, 11, 6, 15.

2. Prove that the root of a max heap contains the largest value in the tree.

3. Does the order in which you insert items into a heap affect the heap that results? Explain.