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 pseudocode function Enqueue () inserts an integer value into the queue. The function is incomplete. There are three incomplete statements. FUNCTION Enqueue(BYREF AQueue : Queue, BYVAL TheData : INTEGER) RETURNS INTEGER IF AQueue.Headpointer = -1 THEN AQueue.QueueArray[AQueue.Tailpointer] \longleftarrow .................................... . AQueue.Headpointer }\longleftarrow AQueue.Tailpointer \leftarrow AQueue.Tailpointer + 1 RETURN 1 ELSE IF AQueue.Tailpointer > ................................... THEN . RETURN -1 ELSE AQueue.QueueArray[AQueue.Tailpointer] \leftarrow TheData AQueue.Tailpointer \leftarrow AQueue.Tailpointer .................................... . RETURN 1 ENDIF ENDIF ENDFUNCTION Write program code for Enqueue (). Save your program. Copy and paste the program code into part 2(c) in the evidence document.

Answer:

Knowledge points:

Solution: