Please write this function in python.

6 accordion recursive (head) Include this function in the file linked_list_recursion_part_2.py. accordion_recursive (head) takes a linked list (which might be empty) as its only parameter, and returns a new linked list, where every other node has been removed. The new list must use the same nodes as the original list (don't create any new ones). When removing nodes from the list, you must remove the old head, the node 2 after the old head, and the node 2 after that, out to the end of the list. For instance, if the input list is like this: 10 -> 20 -> -1 -> "asdf" -> 13 -> "qwerty" -> 1024 then the list that you return must look like this: 20 -> "asdf" -> "qwerty" If the old list contained only a single node, or was empty, return an empty list. This function must be recursive, but is not required to obey the Annoying Requirements