Write a Racket program to define the following functions

(list-item-n n) x : list n : integer value: list element description find the nth element in the list, elements are numbered 0 through length 1. trace (list-item-n '(a b c d e) 2) 'c hint If n is 0 , value is car of x Else call function recursively, replace x with cdr x, replace n with n1 (list-minus-item-n n) x : list n : integer value: list description list with the nth element removed hint if n is 0 , value is cdr of x else cons car x to value of recursive function call, replace x with cdr x,n with n1 trace (list-minus-item-n '(a b c d e) 2) '(a b d e) (rotate-right-1 x ) x: list value: list description similar to rotate-left-1 but right rotation hint find item n1, cons to list-minus-item n1 (reverse-list x ) x : list value: list description list with items in reverse order hint if list is empty or singleton, value is x else append recursive call on cdr of x to list of car of x (cons-to-all a x) a: element x : list of lists value: list of lists description use cons to append a to the head of each element of x note that each element of x is a list use map to apply operation to each element of a list alternatively use recursion on list x