title: Tail Recursion
signature: function tail_recursion(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(16, 20922789888000);
      @printf("TEST-0...%s\n",result);
      
  end
  
  main()
source_py: def tail_recursion(n):
      if (n == 0):
          return 1
      return (n * tail_recursion((n - 1)))
source_cpp: unsigned int tail_recursion(unsigned int n) {
    if ( n == 0 ) return 1;
    return n * tail_recursion ( n - 1 );
  }