If there are c children of the root, how many calls to the merge procedure is required to reassemble the heap?

(a) c

(b) c+1

(c) c-1

(d) 1

Asked question is from Heap in division Heap of Data Structures & Algorithms I

This question was addressed to me in class test.