I know how to write this function regularly, but the question asks to do it recursively, so essentially calling findValue within the findValue definition. How do I do this?

For problems 5 and 6, assume that you have constructed a linked list using the Node () class from your textbook. Here is one such example: >>nl Node (10) >>> n2 = Node (20) >>> n3Node (30) >>> n4Node (40) >>> n2.setNext(nl) >>> n3.setNext(n2) >>> n4.setNext(n3) 5. Use Python and recursion to write a function called findValue that determines whether a given data value is in the linked list. The function returns True if the value is present, and False otherwise. Here are some examples: >>> findValue (10,n4) True >>> findValue (40,n4) True >>> findValue (50,n4) False Note that your function must work on lists other than the example above. You may assume that the list has at least one element