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 ReturnAllData() accesses Thequeue. It concatenates all the integer values that have been inserted into the queue's array, starting from the value stored at HeadPointer, with a space between each integer value. The string of concatenated values is returned. None of the integer values are removed from the queue. Write program code for ReturnAllData(). Save your program. Copy and paste the program code into part 2(d) in the evidence document.

Answer:

Knowledge points:

Solution: