figure removing an item from the middle of the list figure removing the first node from the list needs to be modified in order to complete the remove in this caseit is not previous but rather the head of the list that needs to be changed (see figure line allows us to check whether we are dealing with the special case described above if previous did not moveit will still have the value none when the boolean found becomes true in that case (line the head of the list is modified to refer to the node after the current nodein effect removing the first node from the linked list howeverif previous is not nonethe node to be removed is somewhere down the linked list structure in this case the previous reference is providing us with the node whose next reference must be changed line uses the set_next method from previous to accomplish the removal note that in both cases the destination of the reference change is current get_next(one question that often arises is whether the two cases shown here will also handle the situation where the item to be removed is in the last node of the linked list we leave that for you to consider the remaining methods appendinsertindexand pop are left as exercises remember that each of these must take into account whether the change is taking place at the head of the list or someplace else alsoinsertindexand pop require that we name the positions of the list we will assume that position names are integers starting with self check implement the append method for unorderedlist what is the time complexity of the method you createdit was most likely (nif you add an instance variable to the unorderedlist class you can create an append method that is ( modify your append to be ( be carefulto really do this correctly you will need to consider couple of special cases that may require you to make modification to the add method as well implementing an unordered listlinked lists