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, provide Lisp expressions to generate: (4 c (b 2))

(Q1)This is a Data Structures problem and the programming language used is Lisp. Solve the question we detailed steps and make it concise and easy to understand. Please and thank you.

(Please provide photos so the code is easier to understand) Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function  (defun gcd (n m)"Returns the gcd of two numbers"  (let ((dividend n) (divisor m) (remainder 1))    (while (/= remainder 0)      (setq remainder (mod dividend divisor))      (setq dividend divisor)      (setq divisor remainder))    dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.

def optimize_tail_calls(original_scheme_eval): """Return a properly tail recursive version of an eval function.""" def optimized_eval(expr, env, tail=False): """Evaluate Scheme expression EXPR in Frame ENV. If TAIL, return an Unevaluated containing an expression for further evaluation. """ if tail and not scheme_symbolp(expr) and not self_evaluating(expr): return Unevaluated(expr, env) result = Unevaluated(expr, env) # fill in code code here while isinstance(result, Unevaluated): #code here return optimized_eval scheme_eval = optimize_tail_calls(scheme_eval)

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, make Lisp expressions to generate: (d c b a)

Objective: Practice writing recursive functions in python3  Make the five recursive functions described below in python3 by using the starter code recursive_functions.py. For each function, figure out how to solve it conceptually : write down the base case (when recursion stops) and how each recursive function-call moves towards the base case. The functions should not print anything (except you may add temporary print statements to help debug them). You can test your program by using the provided program test_recursive_functions.py. Don't edit the test program. Put it into the same directory (folder) with your recursive_functions.py and run it. It will import your functions as a module, test your functions, and tell you when each function is returning correct results. 1. Factorial In math, if you have a number n, the factorial function (written n!) computes n x (n-1) x (n-2) x (n-3) x ... x 1. For example: 0! is defined to be 1 1! = 1 2! = 2 x 1=2 3! = 3 x 2 x 1=6 4! = 4 x 3…

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)

(c) Write a BNF description of the following precedence and associativity rules. Assume theonly operands are the names a,b,c,d, and e.

Below, enter code to complete implementation of a recursive function palindrome() that determines whether an input string is a palindrome or not: 3. palindrome(s):

(please type answer)