Problem
1. Write the methods to implement queues by the simple but slow technique of keeping the front of the queue always in the first position of a linear array.
2. Write the methods to implement queues in a linear array with two indices front and rear, such that, when rear reaches the end of the array, all the entries are moved to the front of the array.