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 main program calls Dequeue () twice, and each time it either outputs 'Queue empty' if there is no data in the queue or outputs the return value. The main program then calls ReturnAllData() a second time. Amend the main program. Save your program. Copy and paste the program code into part 2(g)(i) in the evidence document. (ii) Test your program with the following inputs in the order given: Take a screenshot of the output. Save your program. Copy and paste the screenshot into part 2(g)(ii) in the evidence document.

Answer:

Knowledge points:

Solution: