Programming Language

****PLEASE ANSWER ONLY THE 2ND QUESTION USING RACKET PROGRAMMING LANGUAGE*****

If a language other than racket is used I will thumb down and report the answer.

write the following three functions using Racket.

Write the following three functions using Racket. 1. (factorial n) computes n! using the following recursive definition. lif n = 0 n' = n* (n -1)! if n > (0 2. (factorial-sum n) computes 12! +...+n!. Here, you may use the function factorial defined in 1. (factorial-sum-1 n) computes the same sum as part 2, but uses letrec and the lambda construct to define the function factorial within the definition of power-sum1 3. Submit a.rkt file with the definitions of these three function via Canvas by 11:59 PM on Tuesday, February 13