Given an initially empty queue FIFO Queue the following operations are periormed Q . insert ( 1 ) ; Q.insert (2 ) ; Q . remove ( ) ; . remove ( ) ; o. insert ( 3) ; (3) Q.insezt (4) Q . nsert (4) ; Q.insert (5) 3 4 5 5) What value is returned by the first call to remove ) 6) What value is returned by the second call to remove ) 7) What value is at the front of the queue (next to come out)? 8) What value is at the back of the queue (last to come out)