Computer sciences and Information technology

Project description
A The Queue class is defined in the following way:
insert(int x)- adds the value x to the rear of the Queue.
int remove()- removes and returns value of the front Queue item, if there is one.

int front()- returns the value of the front Queue item, if there is one, without removal.
int size()- returns the number of items currently in the Queue.
boolean isEmpty()- returns true if there are no items in the Queue.

Write a first series of black-box tests to ensure the code complies with these descriptions.

Write a second series of white-box tests after examining the code. Provide the code for your tests, results and a short report write-up (3 pages max) on what you discovered 1) about testing and 2) about the code from your effort.