A program stores positive integers in a circular queue. The queue is stored as a global 1D array of 20 integers with the identifier queue. Each index is initialised with the data -1 The global variable HeadPointer, initialised to -1 , points to the first element in the queue. The global variable TailPointer, initialised to -1 , points to the last element in the queue. The global variable NumberItems, initialised to 0 , stores the number of items in the queue. Write program code to extend the main program to call Dequeue () twice and output the return value each time. (ii) Test your program. Take a screenshot of the output(s).

Answer:

Knowledge points:

Solution: