Question

Please help with all four questions regarding LISP Programming. Thank you.

Please answer all questions with output plesase.

LISP Programming Assignment
It is a good idea to start this assignment early; Lisp programming, while not inherently difficult, often seem somewhat foreign at first, particularly when it comes to recursion and list manipulation. This assignment is loosely based on material by Dr. Henri Casanova.  

Problem #1 Define a function that takes two arguments and returns the greater of the two.

Problem #2 Write a function called inches that accepts feet and inches and returns the equivalent length in centimeters. If x is the first argument and y is the second, the formula is 2.54(12x + y). For example,
USER(1): (inches 0 1)
2.54
USER(1): (inches 6 2.5)
189.22999999999999

Problem #3 - Remove an element from a list using Iteration  
Write a Common Lisp function called my-remove that takes an atom and a list in input, and returns a list that is identical to the input list, but with elements equal to the input atom removed, if any. Examples of the function in operation are shown below (user input is in red):
CL-USER(1): (my-remove 'b '(a b c b d)) (a c d) CL-USER(2): (my-remove 'b '(a c d e f)) (a c d e f) CL-USER(3): (my-remove 'a '(b (a d) a d)) (b (a d) d) CL-USER(4): (my-remove 'a '()) nil
Problem #4 - Remove an element from a list using Recursion  
Write a Common Lisp function called my-recursive-remove that takes an atom and a list in input, and returns a list that is identical to the input list, but with all occurrences of the input atom removed, if any. Examples of the function in operation are shown below (user input is in red):
CL-USER(1): (my-recursive-remove 'a '(a b c d)) (b c d) CL-USER(2): (my-recursive-remove 'a '((a b) a (c d e a) (a a) b)) ((b) (c d e) nil b)) CL-USER(3): (my-recursive-remove 'a '((((a))))) (((nil)))
Problem #5 - Flatten a list  
Write a Common Lisp function called flatten that takes a list that may have embedded lists, and returns a flattened version of it (i.e., a list whose elements are only atoms and empty lists have been removed). Examples of the function in operation (user input is in red):
CL-USER(1): (flatten '(a b c d)) (a b c d) CL-USER(2): (flatten '(a () b (c d))) (a b c d) CL-USER(3): (flatten '(a (()))) (a) CL-USER(4): (flatten '(a (b c) (d e (f) ((((((g)))) h)) i) j (k) l)) (a b c d e f g h i j k l)

somoone help me with LIST.Im temible with this lanpuape It is a good idea to start this assignment early Lisp programming, while not inherently difficut often seem somewhat foreien at fies, particularly when it comes to recunion and ist manipulation, This assignment is loosely based on material by Dr.Hen Casanova Make sure you have extemsive comments! Problem#1 Define a finton that takes two ang ne ts andresnsthe pARIoftheno. Problem #2 Write a fndi e called ides that ㏁upS Intundialetlinthe equalet length n centimeters If x is the fint emene and yin the second, the forma 2 For example 388 33 1 nches 2.5 Problem#3-Remove an element from allir using ltenin of the function in operstion ane shown below (user input is ind CL-USER -renoveba bebd Ll Problen 4-Remeve an elemest frem a list using Reeursion Problem 4-Krmeve an elemeat trem alist uing Recurien wete a Common Lup faction cated mr.recurz; ve-renove t t sin .. สเต any Examplies of the fanction in operation are sow below(user input s a be moved). Examples of the function in operation (user iut is in md CLUSER Elatcenabe

Answer 1

Here is the code that you can try :

1 . (defun greater (a b) (if (> a b) a b))

    (print (greater 6 7))

2. (defun convert-one (inches)
(* inches 2.54))

3. (defun my-remove (lst elem &optional final)
(cond
((and (atom lst) (eql lst elem)) nil)
((listp lst) (mapcan (lambda (e) ( my-remove e elem final)) lst))
(t (nconc final lst))))

4. (defun my-recursive-remove (thing l)
(cond ((null l) '())
((eql thing l) '())
((atom l) l)
((eql (first l) thing) (my-recursive-remove thing (rest l)))
((atom (first l)) (cons (first l)
(my-recursive-remove thing (rest l))))
(t (cons (my-recursive-remove thing (first l))
(my-recursive-remove thing (rest l))))))

5. (defun flatten (lst)
(cond
((null lst) nil)
((atom lst) (list lst))
(t (loop for a in lst appending (flatten a)))))

If any doubts ,comment below ...