Look at the pseudocode algorithm:

algorithm TestKU $($int x$)$

if $($x $<8)$ return $(2*$ x$)$

else return $(3*$ TestKU $($x $-8)+8)$

end TestKU

What is the recursive case for the algorithm?

Group of answer choices

x $<8$

$2*$ x

x $>=8$

x $!=8$