Which of the following is the time complexity of Heapify called for the root of the heap?

Select one:

a$.\backslash$Theta $($n log n$)$

b$.\backslash$Theta $($n$2)$

c$.\backslash$Theta $($log n$)$

d$.\backslash$Theta $(1)$

e$.\backslash$Theta $($n$)$