$5-$ Write a recursive Scheme function palindrome$($list$)$ that returns true if the simple list reads the same forward and backward; otherwise returns false. For example, $($palindrome $($a $1$ b $1$ a$))$ returns true, while $($palindrome $($a b$))$ returns false. It must be a recursive solution without using reverse functions. please do not use reverse function.