8. Assume you have a queue q that has already been populated with data. What does the following code fragment do to the queue q? Stack s= new Stack(); while (!q.isEmpty()) s.push(q.dequeue () ); while (!ss.isEmpty()) q.enqueue (s.pop());

Assume that stack and queue are MyStack and MyQueue objects, respectively. WhT are the contents of stack and queue after the execution of the following code fragment.

Need help with python code. Write a LikedStack . Test it by: Add numbers from 7 to 22 in the stack.  Print the length of the stack Check if the stack is empty Show the item on the top of the stack Remove the last item in the stack Add 45 to the stack Remove all items in the stack Check if the stack is empty """File: linkedstack.pyAuthor: Ken Lambert"""from node import Nodefrom abstractstack import AbstractStackclass LinkedStack(AbstractStack):"""A link-based stack implementation."""# Constructordef __init__(self, sourceCollection = None):"""Sets the initial state of self, which includes thecontents of sourceCollection, if it's present."""# Accessor methodsdef __iter__(self):"""Supports iteration over a view of self.Visits items from bottom to top of stack."""def visitNodes(node):"""Adds items to tempList from tail to head."""def peek(self):"""Returns the item at the top of the stack.Precondition: the stack is not empty.Raises: KeyError if the stack is empty."""if self.isEmpty():#…

Why build a circular array stack? Queues need circular arrays.