Asymptotic time complexity of inserting n elements to a binary heap already containing n elements

Question

Suppose we have a binary heap of n elements and wish to insert n more elements(not necessarily one after other). What would be the total time required for this?

I th

Answer 1

its not theeta(nlogn)... its order(nlogn) since some of the insertions can take less then exact logn time... therefore for n insertions it will take time <=nlogn

=> time complexity=O(nlogn)