Use Scheme in DrRacket! A. Create a recursive procedure called (sum-odds max), where max is a number. The procedure should return the sum of all positive odd numbers up to and including max. For example: (sum- odds 10) should give 25. (Hint: you can check if a number is odd using the form odd)

B. Create a recursive procedure called (fib a) to compute terms in the Fibonacci sequence: given a, find the a'th Fibonacci number. Sample output: (fib 0) should give 0, (fib 9) should give 34.