One way to implement a queue is to use a circular linked list. In a circular linkedlist

Chapter 3, Problem 3.35

(choose chapter or problem)

One way to implement a queue is to use a circular linked list. In a circular linkedlist, the last nodes next link links to the first node. Assume the list does not containa header and that we can maintain, at most, one iterator corresponding to a node inthe list. For which of the following representations can all basic queue operationsbe performed in constant worst-case time? Justify your answers.a. Maintain an iterator that corresponds to the first item in the list.b. Maintain an iterator that corresponds to the last item in the list.