Consider the following Scheme program: (define (mystery W) (cond ( (number? W) ( (number? (car W)) (cdr W)) (else (cons (mystery (car W)) (cdr W))) Note that number? is a built-in predicate that returns true if its argument is a number and false otherwise. a. (6%) What does the above Scheme function x do? b. (14%) What is the result of the following calls: (mystery (9 8 (2 4) (4 5)))) (mystery (( (5 3) (8)) (4)))

Using the following variable bindings: (setq x ‘(a b c d)) (setq y ‘(1 2 3 4)) Using only variables x and y, car, cdr, and cons, write Lisp expressions to generate:  ((a c) (1 2)) . a)

I need the answer as soon as possible

Use Dr Racket please.

C++ Suppose the following enumeration type declarations are in the same scope. What is wrong with these declarations?   enum ProgrammingLanguages {JAVA, CPP, PERL, PYTHON, SCHEME, LISP, PHP}; enum Snakes {VIPER, PYTHON, RATTLESNAKE, ANACONDA, COBRA};

Write a function in racket/scheme that takes three angles of a triangle as arguments. If all angles are less than 90 degrees, then return “It is an acute triangle”. If it has a right angle (90 degrees), then return “It is a right angle”. If it has an angle that is > 90 degrees, then return “It is an obtuse triangle”. Dr. Racket Programming