Exercise 10.2.2: Using the bijection rule to count palindromes. About If x is a string, then x is the reverse of the string. For example, if x = 1011, then XR = 1101. A string is a palindrome if the string is the same backwards and forwards (i.e., if X = XR). Let B = {0, 1}. The set Bh is the set of all n-bit strings. Let Pn be the set of all strings in Bh that are palindromes. (a) Show a bijection between Po and B3 Exercise 10.2.2: Using the bijection rule to count palindromes. About If x is a string, then x is the reverse of the string. For example, if x = 1011, then XR = 1101. A string is a palindrome if the string is the same backwards and forwards (i.e., if X = XR). Let B = {0, 1}. The set Bh is the set of all n-bit strings. Let Pn be the set of all strings in Bh that are palindromes. (a) Show a bijection between Po and B3