Need Python code!

The following methods are implemented for you. Everything but str should look familiar. str is provided to give you an example of a recursive function applied to a LinkedList. Recall that str is a builtin method which we have overridden in the provided LinkedList.py file. - init - len - insert_at_head - remove_from_head - str - returns a string representation of the LL. - Following piece of code tests the str method: LL= LinkedList () for i in range(4): LL.add_first(i) str(LL) 320 - You will probably fail your test cases if you try to use str() to implement any functionality below. Deliverables Use recursion to add the attributes described below. Lab Task 1 - Magic Method - in - The template for implementing in method is provided. It is written as method which recursively calls _contains method to check the existense of element in the linked list. - returns a boolean describing whether an item is in the LinkedList: LL=LinkedList() for i in range(4): LL.add_first(i) 3 in LL True 4 in LL False - Non-Magic Method - insert_at_tail - adds item at the tail of LinkedList (See lecture slides for clarification). - It uses another method_add_at_tail recursively to traverse through all the elements to reach to the tail of the linked list. LL= LinkedList() for 1 in range(4): LL.add_last(i) str(LL) 0123