Recall that a bit string is a string using the alphabet {0, 1}. A palindrome is a string that is equal to the reversal of itself. Consider the following recursive definition of a palindrome: Basis Step: λ (the empty string) is a palindrome.
Recursive Step: If w is a palindrome and x ∈ {0, 1}, then xwx is a palindrome.
There is a problem with this definition. Identify and state the problem. Then fix the problem by providing a new and correct recursive definition