7. (15 pts) Write a Scheme function called goodList? that inputs a list and returns #t if the list (1) has at least 2 elements and its first and last element are equal or (2) the list has at least 2 elements and its first two elements are equal. Otherwise the function returns #f [Hint: Use (last Ist) to get the last element in a list named Ist. ) [Hint: Use cond] Examples: (goodList? '(a beb c d a)) => #t (goodList? ( 3 3 5 6 7)) => #t (goodList? '( 46 745)) => #f (goodList? (3) ) => #f (goodList? "O) => #f 7. (15 pts) Write a Scheme function called goodList? that inputs a list and returns #t if the list (1) has at least 2 elements and its first and last element are equal or (2) the list has at least 2 elements and its first two elements are equal. Otherwise the function returns #f [Hint: Use (last Ist) to get the last element in a list named Ist. ) [Hint: Use cond] Examples: (goodList? '(a beb c d a)) => #t (goodList? ( 3 3 5 6 7)) => #t (goodList? '( 46 745)) => #f (goodList? (3) ) => #f (goodList? "O) => #f