Write a recursive function that computes the factorial of n (often denoted n!), i.e. the product n(n-1)(n-2)...(3)(2)(1). Your function MUST be recursive. You may assume the factorial of zero is one.