LISP Program?

Question

Write a recursive function in LISP that completely reverse a given list. For example if our list is (a b (c d) e (f g) h) then answer should be (h (g f) e ( d c ) b a ))

Write a LISP recursive function to reverse the contents of a list. for example if we input a list as (a b (c d) e ( f g) h) then answer should be (h (g f) e ( d c ) b a)

Answer 1

is this auto cad or what need more information