A linear queue data structure is designed using a record structure. The record structure Queue has the following fields: - QueueArray, a 1 D array of up to 100 integer values - Headpointer, a variable that stores the index of the first data item in QueueArray - Tailpointer, a variable that stores the index of the next free location in QueueArray. The function Dequeue () accesses TheQueue. The function returns -1 if the queue is empty. If the queue is not empty, the function returns the next item in the queue and updates the relevant pointer(s). The data is not replaced or deleted from the queue. Write program code for Dequeue (). Save your program. Copy and paste the program code into part $$\(\mathbf{2}(\mathbf{f})\)$$ in the evidence document.

Answer:

Knowledge points:

Solution: