Given a positive number n, the factorial of that number, denoted n!, is equal to 1 × 2 × ... × (n-1) × n. It can also be computed recursively: n! = n × (n-1)!, for all n greater than or equal to zero.

For example,

 3! = 3 × 2! 
    = 3 × 2 × 1!
    = 3 × 2 × 1
    = 3 × 2
    = 6

By convention, 0! is 1.

Complete the following file:

ComputeFact.java

public class ComputeFact { /** A method to compute n factorial (n!) recursively @param n a number >= 0 @return the value of n! */ public static int factorial(int n) { // your work here } }