Which of the following statement$($s$)$ is$/$are correct? $n!$

A$.$ Calculating the factorial can only be done by using a recursive algorithm.

B$.$ A recursive algorithm can have more than one base case that is non$-$recursive.

C$.$ The base case in a recursive algorithm must return something.

D$.$ We can move all elements from a stack to a queue by using the recursion.