JAVA

Write a method called removeMax that takes a stack of integers as a parameter and that removes and returns the largest value from the stack. For example, if a variable called s stores the following sequence of values: bottom [42,8,3,19,7,3,2,42,9,3,2,7,12,80,4] top and you make the following call: the method removes and returns the value 80 from the stack, so that the variable n will be 80 after the call and s will store the following values: bottom [42,8,3,19,7,3,2,42,9,3,2,7,12,4] top If the max value appears more than once, all occurrences should be removed from the stack. For example, given the ending value of the stack above, if we again call removeMax(s), the method would return 42 and would leave the stack in the following state: bottom [8,3,19,7,3,2,9,3,2,7,12,4] top You are to use one queue as auxiliary storage to solve this problem. You may not use any other auxiliary data structures to solve this problem, although you can have as many simple variables as you like. You also may not solve the problem recursively