1GATE CSE 2013 | Question 30Sorting·HeapsMCQ2 marksThe number of elements that can be sorted in Θ(logn)\Theta(\log n)Θ(logn) time using heap sort isSingle correctAΘ(1)\Theta(1)Θ(1)BΘ(logn)\Theta(\sqrt{\log n})Θ(logn)CΘ(lognloglogn)\Theta\left(\dfrac{\log n}{\log \log n}\right)Θ(loglognlogn)DΘ(logn)\Theta(\log n)Θ(logn) Answer key coming soon Show answer