7 .We have a binary heap on n elements and wish to insert n more elements (not necessarily one after another) into this heap. The total time required for this is

#1

the time comp. of insertion in heap is 0( log N) and we are inserting n element so our time compl. would be 0( Nlogn )
but the answer is O(N)
please tell me why ?