Thank you.

Let a=[1,2,3,4,] and b=[1,2,4,8,]. Compute i=120j=110aibj. Problem 8.9. The set P of binary strings has a recursive definition. (1) Po. (a) Show that every string in Po is a palindrome. (2) xPox0xPo (b) Show that every non-empty string in Po has odd length. xPox1xPo (c) Is every palindrome in Po ? (d) Is every palindrome with odd length in Po ? Prove your