Which one is false for Min$-$Heap data structure?

a$.$

Reading the minimum label in the heap takes constant time.

b$.$

Updating a label in the heap takes O$($log n$)-$time.

c$.$

Heap property implies parent node has a smaller label than its children.

d$.$

Constructing a new heap for n elements takes O$($log n$)-$time.