2. Write a program to implement a Circular Array Queue as well as the routines.
3. *Write a program to solve the shortest path in a maze based on a queue. The
program should contain the following functions:
a) Provide an interface for user to initial the maze array by input from keyboard
or scanning from file.
b) Write the routines of array queue, i.e., Enqueue(), Dequeue(), Front(), etc..
c) Write a Solution() function which solve the shortest path problem by calling
the routines.
d) Output the maze in form of matrix on screen.
e) Output the shortest path, e.g., (6, 8)(5, 6), …, on screen.
