6 is sorted (head), is sorted recursive (head) In linked_list_recursion.py , you will write two functions, both of which do exactly the same thing: but one must be recursive, and the other must not be. (The recursive problem is not required to follow the Annoying Requirements, though.) Each of these functions take a linked list (which might be empty) and checks to see if the values are sorted; if so, it returns True; if not, it returns False. (If the list is empty or has a single node, they must return True.)