Consider the problem of visiting every node in a node chain $($e$.$g$.,$ adding up all Node values, printing all Node values, etc$).$ In previous lectures and assignments this was accomplished using loops, but it is possible to also solve this problem using recursion.

In a recursive solution to this problem, a Node, n$,$ is passed in as a parameter to the recursive function.

What would be a reasonable base case? $($select all that apply$)$

Group of answer choices

n is the first element in the node chain

n$.$count $==0$

n is None

this problem cannot be solved using recursion

n$.$get$\_$next$()$ is None