data structure

Question write the algorithm of the following Question only not code.

Problem statement: Assume that a queue 'int_queue' is implemented using an integer array. Write an algorithm/code 'max_in_queue', which finds the maximum element in the queue. The algorithm should fulfill the following constraints. Only queue operations are allowed, and they are already implemented (enqueue, dequeue, head, isEmpty, isFull etc.). No other data structure is allowed except queues. There should be no change in the queue after finding the maximum. [Hint: you will have to use an additional queue.]