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 asks the user to enter 10 integers with values of 0 or greater. It reads each input repeatedly until a valid number is entered. All 10 valid inputs are added to the queue, using Enqueue (). If the value returned from Enqueue () is -1 , a message is output to state that the queue is full, otherwise a message is output to state that the item has been added to the queue. The function ReturnAllData () is called once all 10 integers have been entered and the return value from the function call is output. Amend the main program to perform these actions. Save your program. Copy and paste the program code into part 2(e)(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(e)(ii) in the evidence document.

Answer:

Knowledge points:

Solution: