Code in Python:

Node implementations provided:

class Node: def __init__(self, init_data): self.data = init_data self.next = None def get_data(self): return self.data def get_next(self): return self.next def set_data(self, new_data): self.data = new_data def set_next(self, new_next): self.next = new_next def __str__(self): return self.data

Implement the OrderedList ADT discussed in lectures. You will need to implement the following methods add remove search( is_empty0 . size() The implementations of the Node is provided to you as part of this exercise. You can simply use: Node(), get_next(), set_next(), as well as get_data() and set_data() as necessary in your function definition Note: Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks For example: Test Result name_list -["Gill", "Tom", "Eduardo", "Raffaele", "Serena", "Bella"][Bella, Eduardo, Gill, Raffaele, Serena, Tom] my_orderedlistOrderedList() for name in name list: my_orderedlist.add (name) print(my_orderedlist) Answer: (penalty regime: 0 %) 1 class orderedList: 2 def-init-(self): self.headNone self.counte0 4