Answer the following question :
If a new heap data structure was created that allowed inserting elements into a heap in theta(1) while also allowing the maximum element to be popped in theta(1), what would the runtime of heap sort be with this new data structure?