Computing factorials lends itself to recursion because _________________.
a. It is impossible to compute a factorial using a loop
b. Recursion is most useful for all mathematical computations
c. Computing the factorial of any number relies on computing the factorial of a simpler case
d. The series of if statements required to compute a factorial iteratively would be lengthy