creativity - give complete implementation of the stack adt using singly linked list that includes header sentinel - give complete implementation of the queue adt using singly linked list that includes header sentinel - implement methodconcatenate( for the linkedqueue class that takes all elements of linkedqueue and appends them to the end of the original queue the operation should run in ( time and should result in being an empty queue - give recursive implementation of singly linked list classsuch that an instance of nonempty list stores its first element and reference to list of remaining elements - describe fast recursive algorithm for reversing singly linked list - describe in detail an algorithm for reversing singly linked list using only constant amount of additional space and not using any recursion - exercise - describes leakystack abstraction implement that adt using singly linked list for storage - design forward list adt that abstracts the operations on singly linked listmuch as the positional list adt abstracts the use of doubly linked list implement forwardlist class that supports such an adt - design circular positional list adt that abstracts circularly linked list in the same way that the positional list adt abstracts doubly linked listwith notion of designated "cursorposition within the list - modify the doublylinkedbase class to include reverse method that reverses the order of the listyet without creating or destroying any nodes - modify the positionallist class to support method swap(pqthat causes the underlying nodes referenced by positions and to be exchanged for each other relink the existing nodesdo not create any new nodes - to implement the iter method of the positionallist classwe relied on the convenience of python' generator syntax and the yield statement give an alternative implementation of iter by designing nested iterator class (see section for discussion of iterators - give complete implementation of the positional list adt using doubly linked list that does not include any sentinel nodes - implement function that accepts positionallist of integers sorted in nondecreasing orderand another value and determines in (ntime if there are two elements of that sum precisely to the function should return pair of positions of such elementsif foundor none otherwise