1. Write pseudo code that represents the abstract functions of the enqueue and dequeue operations. Define and explain any supplementary information needed by your pseudo code. 2. Refer to the fixed array implementation in Figure 8.5 of your textbook. Write pseudocode that implements the enqueue and dequeue operations by using a fixed array named Cells. The head of the queue should always be in Cells. Define and explain any supplementary information needed by your pseudocode. 3. Refer to the circular array implementation of your textbook. Write pseudocode that implements the enqueue and dequeue operations using this technique. Define and explain any supplementary information needed by your pseudo code. 4. What do you see as the advantages and disadvantages of each implementation?