# Given the head and tail references, removes a target from a linked list.

predNode = None curNode = head while curNode is not None and curNode.data != target :

 predNode = curNode curNode = curNode.next 

if curNode is not None : if curNode is head : # Handle removing from the beginning

head = curNode.next else :

predNode.next = curNode.next if curNode is tail : # Handle removing from the end/tail of the linked list

 tail = predNode 

Package the implementation provided in Listing 6.8 (on page 171 in your book) for removing a node from a linked list using a tail reference into a function def remove_node( target_value, head, tail ): where target_value specifies the value stored in the node that needs to be removed. The head and tail are references to the first and last nodes in the linked list. First, you must build a linked list either using a linked list implementation or manually. Demonstrate with several examples that the function behaves as expected. Duplicating the scenario provided in the book is one possible way to demonstrate that the code works. However, you should think of providing additional examples. Question 8 Package the implementation provided in Listing 6.10 (on page 171 in your book) for inserting a value into a sorted linked list into a function def insert_node( value, head ): where value specifies the value to be stored with the new node and head is the reference to the first node in the linked list. First, you must build a linked list either using a linked list implementation or manually. Demonstrate with several examples that the function behaves as expected. Duplicating the scenario provided in the book is one possible way to demonstrate that the code works. However, you should think of providing additional examples