Problem 7 (true false)

(a): Given a heap with n elements, the smallest key can be found in "little oh" o(n) operations.

(b): There are six possible heaps on the numbers 1,2,3,4,5

(c): The solution of the recursion is for some constant .

(d): Worst-case of binary search on an array of size 1023 is 10.

Transcribed image text