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. Write program code to declare the record structure Queue and its fields. If your programming language does not support record structures, a class can be declared instead. If you are writing in Python, use comments to declare the appropriate data types. Save your program as Question2_N24. Copy and paste the program code into part 2(a) in the evidence document.

Answer:

Knowledge points:

Solution: