Given a Queue of Integers with the interface: public void enqueue(Integer i) // add to end public Integer dequeue() // remove from front public boolean isEmpty() // return true if empty Write a method rearrange(Queue q) that takes a queue of integers as a parameter and rearranges the order of the values so that all of the odd values appear before the even values and that otherwise preserves the original order of the list.  For example, if a Queue contained [3, 5, 4, 17, 6, 83, 1, 84, 16, 37] after call rearrange it would contain [ 3, 5, 17, 83, 1, 37, 4, 6, 84, 16] You may use any internal data structures you chose. Hint: I recommend even and odd queues in your method.

Using Queues Operation Enqueue,Dequeue, Write a algorithm of method names Contain_Equal that takes the strrings "aaabbb" in queue form as input and returns that the strings contain equal numbers of a's and b's A A A В В В Ouput Must be Like: Both A's and B's are Equal In Quantity Which Is 3.

USE PYTHON

1. Implement, using only the Queue kernel methods, the static method declared as follows and answer the questions below: Reports the smallest integer in the given {@code Queue}. @param q the queue of integer @return the smallest integer in the given queue @requires q /= empty_string @ensures min is in entries (q) and for all x: integer where (x is in entries (q)) (min ivate static int min (Queue q) {...} i. Why do you need the requires clause? ii. Why is the first line of the ensures clause important (min is in entries (q))? Explain what the implementation could do if this line was not included in the postcondition. 2. Implement the static method declared as follows: Reports an array of two {@code int}s with the smallest and the * largest integer in the given {@ code Queue}. * @param q the queue of integer @return an array of two (@code int}s with the smallest and the largest integer in the given queue * @requires q /= empty_string @ensures { minAndMax [0], minAndMax [1] } is subset…