Exercise 1 Consider a Node class which defines a node for a linked data structure, and which is defined as follows: class Node: def __init__(self, itemNone, linkNone): self.item item self.next link Suppose you have a List class that implements a Linked List using the Node class above, and has the following method. def mystery (self): mystery aux (self.head) def mystery_aux (current) if current None: return else: current.item mystery_aux (current.next) return current.item (a) What does the method do? Explain in terms of its effect on the value of a list, that consists of the following items in order 1,2,3.4.5 (b) What is the best and worst complexity in Big O notation of our mysteryO method in terms of the length of the list (N)? c) How would you define the method iteratively