Write a C program to (i) implement the following functions of a Queue using an integer array: queue init0: Make the queue empty empty: return true if the queue is empty. Return otherwise enqueue(val): add the item val to the queue dequeueremove 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, 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: Expected Output Error-Queue is em 78 456 78 456 60 60 Error Queue is em Error Queue is em