Define an unambiguous context-free grammar in BNF capable of generating only palindromes of binary numbers. A palindrome in a Hiring which reads the fame forward as backward, for example, the strings 0, 1,00, 11, 101, and 100101001 are palindrome while the strings 10, 01, and 10101010 are not. The empty Hiring is not in this language