implement the remaining operations defined in the unorderedlist adt (appendindexpopinsert implement slice method for the unorderedlist class it should take two parametersstart and stopand return copy of the list starting at the start position and going up to but not including the stop position implement the remaining operations defined in the orderedlist adt implement stack using linked lists implement queue using linked lists implement deque using linked lists design and implement an experiment that will compare the performance of python list with list implemented as linked list design and implement an experiment that will compare the performance of the python list based stack and queue with the linked list implementation the linked list implementation given above is called singly linked list because each node has single reference to the next node in sequence an alternative implementation is known as doubly linked list in this implementationeach node has reference to the next node (commonly called nextas well as reference to the preceding node (commonly called backthe head reference also contains two referencesone to the first node in the linked list and one to the last code this implementation in python create an implementation of queue that would have an average performance of ( for enqueue and dequeue operations programming exercises