Write a Racket program to define the following functions (rotate-left-1 x) x : list value: list description move all elements of the list one element to the left, head wraps around to tail hints if list is empty or one element, value is the original list else append the cdr of the list to the list consisting of the car (rotate-left-n n) x : list n : integer value: list call rotate-list-left n times hint if n is 0 , value is x else call the function recursively, replace x with (rotate-list-left x ), n with n1. (count-items x ) x : list value: integer description return number of elements in list there is a built-in function to do this, but we're defining our own for practice