Q1) Using Queue algorithm as shown in the code below, create a main class that is capable to store 10 numbers. The program should accept a number entered from the keyboard. The user can add a number while the array is not yet full, once the array is full the program should show message that the array is full and the user can only add another number if the user will remove a number from the array. The program should also inform the user if the array is empty.

Note: The program should have a menu as shown below and include all necessary error checking for this program.

Menu [1] Insert Number [2] Remove Number [3] Display content of the array

[4] Exit

Enter your choice:

Q2) Modify your program in problem number 1. Instead of having one queue. You are task to create a ticketing system for Customer Service counters. Assuming there are 3 counters that need to serve customer of 3 different types of concerns. These are Technical Issue, Billing and New Customer.

Create a ticketing system that will help the Customer Service department in assisting their customer.

Note: The program should have a menu as shown below and include all necessary error checking for this program.

Menu [1] Choose Services

[a] New Customer [b] Billing [c] Technical Issue

[2] Task Accomplished [a] New Customer

[b] Billing

[c] Technical Issue [3] Display Number of Customers

[a] New Customer [b] Billing [c] Technical Issue

[4] Exit Enter your choice:

---------------------------------------------------------------------------

Note: Please use eclipse and dont add any method to this code (I mean do not create display method use just while )

class Queue {

private int maxSize;

private long[] queArray;

private int front;

private int rear;

private int nItems;

public Queue(int s)

{

maxSize = s;

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

rear = -1;

nItems = 0;

}

public void insert(long j)

{

if(rear == maxSize-1)

rear = -1;

queArray[++rear] = j;

nItems++;

}

public long remove()

{

long temp = queArray[front++];

if(front == maxSize)

front = 0;

nItems--;

return temp;

}

public long peekFront()

{

return queArray[front]; }

public boolean isEmpty()

{

return (nItems==0); }

public boolean isFull()

{

return (nItems==maxSize); }

public int size()

{

return nItems; }

}