Need this code in Scheme, Racket. Thank you!

5. Consider the following series: i-o As with the previous problem, you are to write a Scheme routine to calculate the finite sums of this series, that is (finite-my st ery-series k)- Note: for this to work, O! must be equal to (a) Write the Scheme function (finit e-mystery-series k) as defined above. It should work for any non-negative integer k. You will also need to write a fact orial function. (b) Run your function on a number of different k values. What do you observe? What does this finite series seem to approximate? c)How does this finite series approximation compare with the one from Problem 4