I need output

public class PQueuecE extends Comparable > { private E [] elements: private int size: private int head: private int tail: private int count;/constructor implema\entation not printed /isFull () and isEmpty () not printed ublic void enqueue (E item) { if (isFull ()) { return: } count + +: elements [tail] = item: tail = (tail + 1) % size: ublic E dequeue () { if (isEmpty ()) return null: int ct = count - 1: E cur = elements [head]: int index = theta: for (i = 1: ct - - > theta: i + +) { if cur. compareTo (elements [(head + i) % size]: index = i: } } return removed ((head + index) % size): public E removed (int index) { E item elements [index] if (index = tail) { int i: for (i = index: (i % size) = tail: 1 +) { int j = i % size: elements [j] = elements [(j + 1) % size]: } } tail = (tail - 1) % size: count - -: return item: } } public class Test { public static void main (string [] argv) { pQueue queue = new pQueue (): for (int i = 1: i