Write a C program for (a) , (b) , (c) and (d) to:

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