Discrete Structures

– You must justify your answers.
– The answers should be concise, clear and neat.
– When presenting proofs, every step should be justified.

please answer the question step by step. Thanks inadvance.9. A bitstring sis2 . . . Sr, is called a palindrome. If i.e., reading the string from left to right gives the same string as

9. A bitstring sis2 . . . Sr, is called a palindrome. If i.e., reading the string from left to right gives the same string as when reading it from right to left. For any integer n 2 1, let Pn be the number of bitstrings of length n that are palindromes Which of the following is true for any integer n 2 3? (c) P-2 P-1 10. Let n 1 be an integer and consider a set B- {[B, B2 , B, of n beer bottles and a set C C1.. of n cider bottles For any integer k with 0 1, the number of 00-free bitstrings of length m Is equal to the (m + 2)-th Fibonacci number fm +2 What is the number of 00-free bitstrings of length 55 that have 0 at position 9, and 1 at position 40? (The positions are numbered 1,2….. 55.) (a) f fa fis 8J30 J16 (d 32 18 Show transcribed image text