Now implement the factorial function yourself. You've seen the code and traced through the logic.
Your function takes a non-negative integer and returns (n factorial).
Requirements:
- (base case)
- (recursive case)
- Return an integer
Examples:
factorial(0)->factorial(5)->factorial(10)->
Remember: define the base case first, then the recursive case. Each call should bring you closer to the base case.