A program reads data from a text file and stores it in a queue. The linear queue Queue is stored as a 1D array of up to 50 elements. The queue has the following pointers: • HeadPointer – this stores the index of the first element in the queue, initialised to -1 • TailPointer – this stores the index of the last element in the queue, initialised to -1

1. (a)Queue is a global array of 50 integers with all elements initialised to -1 in the main program. The two pointers are declared as global variables and initialised to -1 Write program code to declare and initialise Queue, HeadPointer and TailPointer[3]
2. (b)The function Enqueue(): • takes an integer parameter to store in the next position in the queue • returns FALSE if the queue is full and the parameter cannot be stored in the queue • returns TRUE if the parameter is stored in the queue • updates the pointers where appropriate. Write program code for Enqueue()[6]
3. (c)The function Dequeue(): • returns the next item in the queue, if the queue is not empty • returns -1 if the queue is empty • updates the pointers where appropriate. Write program code for Dequeue()[5]
4. (d)The text file QueueData.txt stores positive integers. Each integer is on a new line in the file. The procedure CreateQueue(): • opens the file QueueData.txt • reads in each line from the text file and uses Enqueue() to insert each line into the queue • outputs "Queue full" if any item cannot be inserted into the queue • uses exception handling when opening and reading from the text file. The procedure needs to work for a file that contains an unknown number of lines. Write program code for CreateQueue()[6]
5. (e)(i)The main program needs extending to call CreateQueue().The main program then adds together all of the integers stored in the queue, using Dequeue() to access each integer. The total is then output. Write program code to extend the main program.[5]
6. (e)(ii)Test your program. Take a screenshot of the output(s).[1]