2. From Summation to Factorial The definition of the factorial function is defined below. Using the summation code as a guide, write a very similar recursive method that calculates the factorial of some input n. This method should be like all recursive functions in that it knows how to solve a trivial case(case1), and the function knows how to decompose larger cases into smaller cases(case2). Just as for and while loops use a boolean expression to govern loop termination, so too will we use a boolean condition in combination with an if to control repetition, as demonstrated here: if (case1) { return base case solution; //for summation, factorials, exponent, and Fibonacci, this is 1 } else (2) { result = recursive call //typically the recursive call decrements by 1 or n/2 return result; } Build this new recursive method and test your code with a short main driver.