Problem
1. Write the methods to implement queues, where the implementation does not keep a count of the entries in the queue but instead uses the special conditions
rear = -1 and front = 0
to indicate an empty queue.
2. Rewrite the methods for queue processing from the text, using a flag to indicate a full queue instead of keeping a count of the entries in the queue.