plementation Requirements Write a C program to (i) implement the following functions of a Queue using an integer array: - queue_init(): Make the queue empty - empty(): return true if the queue is empty. Return otherwise - enqueue(val): add the item val to the queue - dequeue(): remove the item least recently added to the queue - front(): return the item least recently added to the queue, but do not remove it. (ii) the program reads in integer values as input: - for a positive integer input value greater than 0 , the program will insert the value into the queue, i.e. enqueue - for any negative integer input value, the program will return the least recently added value from the queue if it is non-empty, i.e. front - for the input value 0 , the program will remove the least recently added value from the queue if it is non-empty, i.e. dequeue (iii) test your program with the following set of input: 5. Additional Implementation Requirements Some of the following parts will be selected for the student to implement during their lab session. a) Write a function is_full that returns true or false to indicate whether the array that implements a stack is full. Assume that SIZE specifies the size of the array. b) Write a version of push that checks for a full array. If the array is full, the function simply returns false. If the array is not full, the behaviour is the same as the original push, except that the function also returns true. Assume that SIZE specifies the size of the array. c) Write a version of enqueue that checks for a full array. If the array is full, the function simply returns false. If the array is not full, the behaviour is the same as the original enqueue, except that the function also returns true. d) Write a function rear that returns, but do not remove, the most recently added item in a queue