By using the operation functions in the table below, write a program that shows how queue works. Use the list: 37 18 2 43 as the sample value. Your program should: (a) Display the front element of queue (b) Display the last element of the queue (c) Pop the front element of the queue (d) Display all the final queue Operation size empty push (item) front back pop Effect Returns the actual number of elements in the queue. Returns true if the queue is empty, and false otherwise. Inserts a copy of item into the queue. Returns the first element in the queue but does not remove the element from the queue. This operation is implemented as a value- returning function. Returns the last element in the queue but does not remove the element from the queue. This operation is implemented as a value- returning function. Removes the next element in the queue.