(10%) Construct a max-oriented heap by inserting the keys E, A, S, Y, Q, U, E, S, T, I, O, N into an initially empty heap in the given order. Provide the final heap represented as an array after all the keys have been inserted.

(5%) Determine the time complexity of inserting an element into a max-oriented heap. Specifically, analyze the insertion process, considering how the heap property is maintained after the insertion.

(5%) Determine the amortized time complexity of inserting an element in to the max-oriented heap when a resized array is used. Assume the following resizing rule: when the array becomes full, it is resized by doubling its current size.