Exercise 1: Acquire scheme (either version) and start it up. See attached notes on how to do this. Exercise 2: ;Without evaluating, which of these are valid scheme expressions? ;If they're valid, give the values they evaluate to. + 2 * 3 (2 * 3) (* 2 3) ((* 2 3)) -3 - 3 (- 3) (define x 3) (define x 4 5 6) (define x * 1 2) Then evaluate them in scheme and see if you were correct. Exercise 3: Cut and paste a couple of the problems from lecture into scheme and evaluate them. Then test them a little. Try finding the 10th, 30th, and 40th fibonacci number. How long does it take? How long might it take to compute the 100th fibonacci number this way? Exercise 4: Write a procedure that computes the remainder of a division. For example, 42 divided by 17 yields a remainder of 8. So (remainder 42 17) is 8. First, come up with a plan, then think about the code. Exercise 5: Write a procedure that returns true if the first number is divisible by the second number. Once again, come up with a plan first, then solve. You should probably use your procedure from exercise 4. (divisible? 42 17) -> #f (divisible? 42 2) -> #t