In this assignment, you will be learning Scheme through the use of DrRacket. We start with some basic concepts; trying to understand prefix notation and using procedures in Scheme. You may only use the procedures shown in the text and slides also see below for three prohibited forms in this assignment - not any of the additional library procedures in R5RS Scheme. Solve the following questions in the .rkt template provided.

6. 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: (sumodds 10) should give 25. (Hint: you can check if a number is odd using the form odd?) 7. 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