Recursion is an algorithm structure. Recursion will appear in subroutines, in the form of calling itself directly or indirectly. A typical example is factorial, and the calculation rule is: n!=n×(n−1)!n!=n \times (n-1)!, basically as follows: let fac = (n)=> { if(n == 1)...
Write code to complete print_factorial()'s recursive case. Sample output if user_val is 5: 51 = 5 * 4 * 3 * 2 * 1 = 120 Complete the following tester program by choosing the line that prints the expected outcome. Remember that the expected outcome...