Important Notes: the following notes must be taken into consideration in your solution

to get credits:

Queue class has the following methods:

a$.$ void add$($Integer i$),//$enqueue: adds an element at the rear$($end$)$ of the queue

b$.$ Integer remove$(),//$dequeue: removes the element from the front of the queue

c$.$ Integer front$(),//$ returns the element at the front of the queue

d$.$ int size$()//$ returns the number of elements in the queue.

Assume that the input queue has at least one even number.

You cannot use any other data structure or array.

Do not make any assumptions about how the queue data is stored.