JAVA. Please follow the guidelines please, question is below the guidelines

Guideline:

Each problem will indicate what kind of structure to use as auxiliary storage. You should not use any other auxiliary data structures to solve the problems, although you can create as many simple variables as you'd like. It is the authors' intent that you use stacks/queues in stack/queue-like ways only when solving these problems. For example, you should not call index-based methods such as get, search, or set (or use a for-each loop) on a stack/queue. You may call only add, remove, push, pop, peek, isEmpty, . , and size. It is also possible to solve all of the exercises without using peek if you want an extra challenge. For problems that accept a stack or queue as a parameter, unless otherwise specified, you should make sure that your method does not damage the state of the parameter. That is, if you modify the parameter stack or queue's elements in your method, you should restore the parameter collection to its original state before your method returns. . Some of these problems have elegant recursive solutions, but the authors' intent is generally that you should not solve these problems recursively, because recursion can circumvent some of the tricky stack/queue manipulation that you are supposed to practice. 6. Write a method called rearrange that accepts a queue of integers as a parameter and rearranges the order of the values so that all of the even values appear before the odd values and that otherwise preserves the original order of the queue. For example, if the queue stores [3, 5, 4, 17, 6, 83, 1, 84, 16, 37], your method should rearrange it to store [4, 6, 84, 16, 3, 5, 17, 83, 1, 37] . Notice that all of the evens appear at the front followed by the odds and that the relative order of the evens and odds is the same as in the original. Use one stack as auxiliary storage