What is the worst case time in searching minimum value in weak -heap?

(a) O(log n)

(b) O(n)

(c) O(n logn)

(d) O(1)

This intriguing question comes from Weak Heap topic in portion Heap of Data Structures & Algorithms I

The question was posed to me in examination.