Python number 1. is already done it is on the image, looking for help or insight for 2, 3, and 4.1. From page 146, #22: Implement a stack using linked lists.2. From page 146, #23: Implement a queue using linked lists.3. From page 146, #24: Implement a deque using linked lists.4. From page 147, #25: Design and implement an experiment that will compare the performance of a Python list with a list implmentd as a linked list class EmptyStack (Exception):_init__(self):defsuper (). __init__('Stack is empty: invalid operation!#linked list nodeclass Node:def_init_ (self):self.data = Noneself.next = None#linked list classclass LinkedList:definit (self):self.head = Noneself.size = 0def get_size (self):return self.sizedef add (self, item) : #to push element to stackself.node = Node ()self.node.data = itemself.node.next = self.headself.head = self.nodeself.size += 1def remove (self):if self.head == None:raise EmptyStackself.head_item = self.head.dataself.head = self.head.nextself.size = 1return self.head_item#creating Stack using linked listclass Stack:def init (self):-self.s = LinkedList ()def get_size (self):return self.s.get_size()def push (self, item): # to push element to stackself.s.add(item)def pop (self):return self.s.remove()1==namemain':stack Stack()for i in range (8):stack.push(i*2)print('size: {}'.format (stack.get_size()))print ("Popped element: ", stack.pop())print ("New size:" stack.get_size())Iif

Note: as per company guidelines we are supposed to answer only one question at a time . please resot…

Answered: Python number 1. is already done it is…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Python number 1. is already done it is on the image, looking for help or insight for 2, 3, and 4.

1. From page 146, #22: Implement a stack using linked lists.
2. From page 146, #23: Implement a queue using linked lists.
3. From page 146, #24: Implement a deque using linked lists.
4. From page 147, #25: Design and implement an experiment that will compare the
performance of a Python list with a list implmentd as a linked list