Hi coudl you pls help me with this question thank you!

Given is a concrete class named MyQue that implements the following standard Queue interface: enqueue(e) Adds element e to the back of queue. dequeue() Removes and returns the first element from the queue (or null if the queue is empty). first() Returns the first element of the queue, without remov- ing it (or null if the queue is empty). size() Returns the number of elements in the queue. isEmpty() Returns a boolean indicating whether the queue is empty. Describe an algorithm, named MoveBigToFront(Q), that will take a queue Q of integer values as an input object. Your algorithm must determine which value in Q is the largest and move that value to the front of Q, leaving all the other values in Q in their original order. For example, if on entry Q contains the values (front 6 14 3 47 9 rear) then, after a call to MoveBigToFront(Q), it will contain the values (front 47 6 14 3 9 rear). You may (a) only use an extra queue if needed. (b) use scalar variables (such as int or double) if needed. (c) assume that the input Q will not contain duplicate values. (d) describe your algorithm in pseudo-code or Java code, as long as your description is clear. You may not use other methods, classes, or data structures from the Java collections or elsewhere