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 creates a new Queue record with the identifier TheQueue. The head pointer is initialised to -1 . The tail pointer is initialised to 0 . Each element in the array is initialised with -1 . Write program code for the main program. Save your program. Copy and paste the program code into part 2(b) in the evidence document.

Answer:

Knowledge points:

Solution: