Write the pseudocode for the most time$-$efficient way to implement the operations listed below.

Assume no duplicate values and that you can implement the operation as a member function of the class

$$ with access to the underlying data structure, including knowing the number of values currently stored

$($N$).$

Then, give the tightest possible upper bound for the worst$-$case running time for each operation in

terms of N$.$ For any credit, you must explain why it gets this worst$-$case running time.

Given a FIFO queue $($Implemented as an Array of size N$),$ find which value is the maximum value and

delete it$.$ When you finish, the rest of the values should be left in their original order