Consider the following recursive method.

public int puzzle$($int num$)$

$\{$

if $($ num $1)$

return $1$ ;

else

return num $+$ puzzle$($num $/2)$;

$\}$

What value is returned when puzzle$(10)$ is called?

$($A$)18$

$($B$)15$

$($C$)11$

$($D$)1$

$($E$)$ Nothing is returned. Infinite recursion causes a stack overflow error.