Write a procedure that returns the elements of given list in reverse order.
Write a LISP function to implement nthcdr (skip first n elements).
Write a LISP function r-rotate-n, which rotates n elements of a given list to the right. Eg. (r-rotate-n ‘(a b c d e) 3) Expected o/p -> (c d e a b)
Write a LISP function to insert element at the given position into given list.
Write a program which will find greatest common divisors of given 2 numbers.
Write a recursive program that returns a list of first n elements in a list.
Write a program which determines whether the given item is present in an expression.
Write a program to find the last element of the list. (use IF, ENDP, and REST)
Write a program which will extract a slice (elements from mth position to nth position) from a list.
Write a LISP function pal to check whether the given list is palindrome or not.