An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of

(a) O(n*n*logn)

(b) O(n*logn)

(c) O(n*n)

(d) O(n *logn *logn)

The doubt is from Heap in chapter Heap of Data Structures & Algorithms I

I got this question in a national level competition.