Which of the following is false regarding heap?The worst case complexity of heap sort is O$($n$^2).$It is efficient to keep heap elements in an array.The maximum element in a heap is at the root.The second largest element becomes the new root after the deletion of the root in a heap.Complexity of removing root from a heap is O$($logn$)$