a) Which array out of A, B and C represents a binary heap? Only one answer is right. A- 1 12 23 10 15 38 45 15 18 20 21 2 3 10 11 b) Write the heap out as a binary tree. c) Add last 2 digit of your arid no. to the heap, - 18 27 10 45 83 91 31 12 52 51 2 3 4 10 making sure to restore the heap invariant. C= 1 13 20 21 65 54 67 41 30 83 52 How does the array look now?

A. Consider the three given arrays (a), (b) and (c): 13 22 33 20 25 45 55 25 28 30 31 (a) 10 11 12 23 30 31 75 64 77 51 40 93 62 (b) 2 10 11 13 18 32 21 53 89 97 42 23 60 59 (c) 10 11 i) Which of the following arrays above represents a binary heap? Justify your choice. ii) Draw the heap as a binary tree. iii) Perform insert (29) operation to the heap. Show all your steps and show how the array looks like after the operation is done. iv) Perform removeMin operation on the heap. Show all your steps and show how the array looks like after the operation is done.

What is this question asking? Such what would the solution to this prompt be, in regarding it?

Suppose we have an ArrayHeap that uses the array representation from class (also called "tree representation 3B" in lecture). Recall that in this representation that the leftmost item is unused. Consider a heap with the following underlying array: -8 -2 9. 1 10 10 12 Suppose we perform an in-order traversal of the heap represented by this array. What will be the last value in the in-order traversal? O -8 O 5 O-2 O 9 O 8 O 1 O 10 O 12