Question 1: 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 ] 4 7 6 9 2 8 3 1 5

10 [ Choose ] 4 7 6 9 2 8 3 1 5

7 [ Choose ] 4 7 6 9 2 8 3 1 5

9 [ Choose ] 4 7 6 9 2 8 3 1 5

2 [ Choose ] 4 7 6 9 2 8 3 1 5

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

Question 3: 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

9 [ Choose ] 5 7 9 6 2 1 3 4 8

10 [ Choose ] 5 7 9 6 2 1 3 4 8

14 [ Choose ] 5 7 9 6 2 1 3 4 8

1 [ Choose ] 5 7 9 6 2 1 3 4 8

2 [ Choose ] 5 7 9 6 2 1 3 4 8

16 10 14 7 9 3 2 8 D 16 10 14 7 9 3 2 8 D 4 3 2 i 16 9 10 14 8 7