The following code is supposed to return n$!,$ for positive n$.$ An analysis of the code using our "Three Question" approach reveals that:

int factorial $($int $n$

if $)>(0$

return $*$ factorial $(n-1)$

$\}$

A$.$ it fails the smaller$-$caller question.

B$.$ it fails the base$-$case question.

C$.$ it fails the general$-$case question.

D$.$ None of these is correct.

E$.$ it passes on all three questions and is a valid algorithm.