Question: Question 2: Matching. This exercise is about how to represent a heap H as an array A . We assume that the first element has
Question 2: Matching.
This exercise is about how to represent a heap H as an array A. We assume that the first element has index 1. Consider this heap H :

Match each key K with its index i in the array A.
Group of answer choices
4 [ Choose ] 7 1 2 9 3 8 4 5 6
10 [ Choose ] 7 1 2 9 3 8 4 5 6
7 [ Choose ] 7 1 2 9 3 8 4 5 6
9 [ Choose ] 7 1 2 9 3 8 4 5 6
8 [ Choose ] 7 1 2 9 3 8 4 5 6
16 10 14 7 9 3 2 8 D
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
