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 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 ( )

Answer:

Knowledge points:

Solution: