Hello, please help out and answer these questions, thank you!

Discussion Questions In addition to uploading your code to Dropbox, you must also turn in handwritten answers to the following questions 1. A bit string is a string that consists entirely of O's and 1's, as in 0011101. Bit strings can be palindromes the same as any other string, if they are "spelled" the same forwards as backwards. (a) List al bit strings of length 1 that are palindromes. (There are two.) b) List al bit strings of length 2 that are palindromes. (c) List all bit strings of length 3 that are palindromes. Hint: for each palindrome of length 2, in sert either a 0 or a 1 in the middle of the string to make a new string that is a palindrome. d) List a bit strings of length 4 that are palindromes. (e) List all bit strings of length 5 that are palindromes using the same procedure as in (c) (f) How many bit strings of length n are palindromes? Your answer should be in terms of n, and will probably need different equations/results depending on whether n is even or odd; it should also be consistent with your answers to (a) through (e)