[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:


a. 1
b. 2
c. 3 or 4
d. 5 or 6