Define a recursive Scheme procedure (remove-last-even lst) which returns the list with the last even number removed. For example: (remove-last-even '(1 -2 -3 4 5)) (1 -2 -3 5)

Write a Scheme procedure (manhattan a b) which, given two pairs representing points on the Cartesian coordinate system, returns the Manhattan distance between the two points.

Write a Scheme procedure remove-dups which takes a list of words/letters as input and returns the list with consecutive repeated words/letters removed. Note that multiple instances of a letter are allowed if they are not consecutive. For example, (remove-dups (a b c c d d c a a b)) (a b c d c a b)

Write a Scheme procedure called (integer->binary x) that converts an integer to a binary number represented as a list of 0s & 1s. For example: (integer->binary 20) (1 0 1 0 0)

OUTPUT:

"Question 1: remove-last-even " (1 -2 4) (1 2 3) (2 3 5 7 9) (-1 -2 -3 -5) (3 5 7 9) (1 3 5 7 9) "Question 2: manhattan" 7 17 "Question 3: remove-dups " (a b c d) (n o t b r o k e !) (T) "Question 4: integer->binary" (1) (1 1 1 1) (1 0) (1 0 1 0 1 0 1 0 1 0)