Need help writing this code in Scheme, Racket. Thank you!

a) Write a Scheme function (finite-sum-of-powers z k) that evaluates to the sum of the first k +1 terms in the above sum (that is, the sum from 0 to k). You can use Scheme's expt function, as (expt z n) evaluates to z (b) We will now measure how large k needs to be in the above function to provide a good approximation of the infinite sum. You will write a Scheme function (terms-need ed z tol) that will evaluate to the number of terms in the infinite sum needed to be within tol, that is, the smallest k such that the difference between and (finite-sum-of-powers z k) is less than tol. You can assume for this function that 0 sz