; Problem 1a (15 points) Write a Scheme function quo of one integer argument d which returns a function of one integer ; argument n so that ((quo d) n) is the quotient on dividing n by d. For example, ((quo 4) 6) 1, as 4 divides 6 just one time Assume n and d>0. The function returned by (quo d) should be properly recursive, and should work by repeated subtraction. Problem 1b (10 points, including synergy) Prove by induction that the call (quo d) of your function quo returns a function which actually does compute the quotient on dividing n by d, assuming n and d>. Don't forget to include a termination argument ; Problem 1a (15 points) Write a Scheme function quo of one integer argument d which returns a function of one integer ; argument n so that ((quo d) n) is the quotient on dividing n by d. For example, ((quo 4) 6) 1, as 4 divides 6 just one time Assume n and d>0. The function returned by (quo d) should be properly recursive, and should work by repeated subtraction. Problem 1b (10 points, including synergy) Prove by induction that the call (quo d) of your function quo returns a function which actually does compute the quotient on dividing n by d, assuming n and d>. Don't forget to include a termination argument