Build Min heap O(n)
Delete min elements upto k times = k * O(log n)
Insert all k elements back k * O(log n)
Dominating term O(n) so (D) is the answer.
Since Omega() will be the lower bound, but here in worst case k = n, so O(n logn) should be given for n logn to be a correct answer.