Time left $0$:$03$:$29$

What does the following function do for a given Linked List with first node as head?

void DoSomething $($Node head$)\{$

if $($head $==$ null$)$

return;

DoSomething $($head: heach next$)$ ;

System. out.print $($head$.$value $+"")$;

$\}$

A$.$ Prints all nodes of linked$-$list

B$.$ Prints alternate nodes of linked$-$list

C$.$ Prints alternate nodes in reverse order.

D$.$ Prints all nodes of linked$-$list in reverse order.

Clear my choice