fill the blanks

Question 22 of 27 /14 marks A singly-linked list can be used to implement the Queue operations enqueue ( efficiency reasons, we choose the front from the queue to x), dequeue 0, and other operations on the queue. For t, and rear of the unct ueue) function is implemented by re tail of the list. Fill the following four blanks by pseudo-code missed to complete the functions needed in enqueuex), dequeueo, fronto) and size) respectively. enqueue (x) "insert object x at the rear of the queue" Node u = new Node0: (blank a) return x dequeue 0 "remove and return from the queue the object at the front; an error occurs if the queue is empty if (n0) return null (blank b) return x front0 "return, but do not remove, the front object in the queue (blank c) return x size0 return the number of objects in the queue" (blank d) return x anTrack Technolog es inc Ail Rights Reserved Terms of Use | Privacy Policy |Contact Us /Attributions