[Computer Science: Data Structures & Algorithms]: We have an array of 8 integers that have been passed through a "heapify" algorithm, but we aren't done. After some number of operations, the array looks like [16 14 15 10 12 27 28].
How many operations have been performed on the (assumed current) root of the heap (i.e. 16)?
Example of such an algorithm:
https://www.tutorialspoint.com/data_structures_algorithms/images/max_heap_animation.gif
a. 1
b. 2
c. 3 or 4
d. 5 or 6
