Consider the following algorithm:

function foo$($node$)\{$ if node is null:

return foo$($node$.$next$)$

print node.value $\}$

What would the output of this function if given the following linked list as an input? Show your work.

Head $->12->3->5->2->$ null