Implement the “missing” front and rear operations in JAVA using constructor and Also write output:

1. Implement the “missing” front and rear operations in JAVA using constructor and

Also write output:

class Queue

{

private int maxSize; private long[] queArray; private int front;

private int rear; private int nItems;

public Queue(int s) // constructor

{

maxSize = s;

queArray = new long[maxSize]; front = 0;

rear = -1;

nItems = 0;

}

//

public void insert(long j)

{

// put item at rear of queue

//

public long remove()

{

// take item from front of queue

//And then return

}

//

public long peekFront()

{

// peek at front of queue

//Return queue array front

}

//

public boolean isEmpty(){

// true if queue is empty

//return nItems zero

}

//

public boolean isFull()

{

// true if queue is full return

}

//

public int size() // number of items in queue

{

//return nItems;

}

//

} // end class Queue

//////////////////////////////////////////////////////////////// class QueueApp

{

public static void main(String[] args)

{

Queue theQueue = new Queue(5); // queue holds 5 items theQueue.insert(10); // insert 4 items theQueue.insert(20);

theQueue.insert(30); theQueue.insert(40); theQueue.remove(); // remove 3 items theQueue.remove(); // (10, 20, 30) theQueue.remove();

theQueue.insert(50); // insert 4 more items theQueue.insert(60); // (wraps around) theQueue.insert(70);

theQueue.insert(80);

while( !theQueue.isEmpty() ) // remove and display

{ // all items

long n = theQueue.remove(); // (40, 50, 60, 70, 80) System.out.print(n);

System.out.print(“ “);

}

System.out.println(“”);

} // end main()

} // end class QueueApp