listsstacksand queues in the list assume that you are given linked list that contains nodeshoweverthe value of is unknown design an (nalgorithm to determine if the list contains cycle you may use (nextra space repeat part ( )but use only ( extra space (hintuse two iterators that are initially at the start of the list but advance at different speeds one way to implement queue is to use circular linked list in circular linked listthe last node' next pointer points at the first node assume the list does not contain header and that we can maintainat mostone iterator corresponding to node in the list for which of the following representations can all basic queue operations be performed in constant worst-case timejustify your answers maintain an iterator that corresponds to the first item in the list maintain an iterator that corresponds to the last item in the list suppose we have pointer to node in singly linked list that is guaranteed not to be the last node in the list we do not have pointers to any other nodes (except by following linksdescribe an ( algorithm that logically removes the value stored in such node from the linked listmaintaining the integrity of the linked list (hintinvolve the next node suppose that singly linked list is implemented with both header and tail node describe constant-time algorithms to insert item before position (given by an iteratorb remove the item stored at position (given by an iterator