Please help with this Python problem.

4. Now that we're more experienced making our own data structures, we'll build a new type of list, called a linked list. Linked lists are made up of nodes. Each node contains one list element, along with a link to the next node in the list. (Hence the name.) Create a Linked_List object that implements a linked list. It should use a helper class Node. It should implement the following methods: Linked_List() creates a new list that is empty. It needs no parameters and returns an empty list. add item) adds a new item to the beginning of the list. It needs the item and returns nothing. remove(item) removes the item from the list. It needs the item and modifies the list. If the item isn't in the list, it raises an error. search(item searches for the item in the list. It needs the item and returns a boolean value. isEmpty() tests to see whether the list is empty. It needs no parameters and returns a boolean value. 2 size() returns the number of items in the list. It needs no parameters and returns an integer. append(item) adds a new item to the end of the list making it the last item in the collection. It needs the item and returns nothing. index(item) returns the position of item in the list. It needs the item and returns the index. If the item isn't in the list, it raises an error. insert(pos,item) adds a new item to the list at position pos. It needs the item and returns nothing. If the list is too short, then it raises an error. pop() removes and returns the last item in the list. It needs nothing and returns an item. If the list is empty, it raises an error. pop(pos) removes and returns the item at position pos. It needs the position and returns the item. If the list is too short, then it raises an error