python please

An implementation of the Stack ADT is shown in the answer box for this question. Extend the Stack class by adding the method slice(self, start, stop, step) which takes 3 integers as parameters and returns a subset/slice of the stack. It must be a new and independent copy of the existing stack. You should be able to push and pop from either the new one or the original one without influencing the other. The original stack should not be altered when the method completes. Note: start - Starting index where the slicing of the object starts. stop - index value until which the slicing takes place. The slicing stops at index stop -1 (last element). step (optional) - index value which determines the increment between each index for slicing. Defaults to 1 if not provided. Submit the entire Stack class definition in your answer to this question. For example: Test Result Stack: [3, 4, 5, 'a'] object head fruit 'apple' 'banana' "cherry Add the has_same_elements (self, list2) method to the LinkedList class above. This method takes a LinkedList object as a parameter and returns True if the linked list and the parameter linked list contain exactly the same elements in any order and have exactly the same number of elements. In all other cases the function returns False. Notes: You may assume that the Node class is defined for you. Do not define a new Node class. Submit your entire LinkedList class definition in the answer box below. For example: Test Result False a_list1 = LinkedList() a_list2 = LinkedList() for element in [3, 13, 6, 1, 8, 9]: a_list1.add(element) for element in (1,3, 6, 9, 8]: a_list2.add(element) print(a_list1.has_same_elements (a_list2)) True a_list1 = LinkedList() a_list2 = LinkedList() print(a_list1.has_same_elements (a_list2))