python help!

thank you

Consider the Node class below class Node: def __init__(self, init_data): self.data-init_data self.next = None def get.data seLf): def get_next(self): def set_data(self, new_data): def set_next(self, new_next): def __str__(self): return self.data return self.next self, data new-data = self.next -new_next return self.datoa Using the Node class, provide an implementation of the Unordered List ADT as discussed in lectures. You will need to implement the following methods add remove) search Is_empty0 . size) . _str_0