Need correct code for ADT.py

Mod 4 Lab: Linear Data Structures and Linear ADTs We will implement two abstract data types (stacks and queues) using two different data structures (lists and linked lists). You can find code for implementing linear ADTs in lectures, the textbook, and any popular coding forum. Do not access these resources during lab. Spend your 75-minute lab period trying your best to implement these classes with your partner; it's the best way to learn this material. Feel free to use other resources after lab. A quick note We are rapidly approaching exam 1 - now is the time to get very comfortable with writing your own tests if you are not already. Use test-driven development for this assignment: - Red - write a test, run your code, verify it fails - Green - modify your code to pass that test - Refactor - factor out any duplicate code Part 1 - Build ADTs with different data structures ADT. py contains skeleton code for list and linked list versions of stacks and queues. Node.py file is also provided which contains the private Node class. Using the concepts learnt from lecture, implement the stack and queue ADT using list and singly linked list. - Use test driven development (red-green-refactor) to implement the core functionalities for each class: and for stacks and for the queues - Use lists (_L ) or linked lists (_LL ) as denoted by the class names - Include tests for each method in the public interface of each class - You can use statements or - the choice is yours