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)