The following two questions refer to bit strings.

a) In pseudo-code produce a recursive algorithm that determines whether a bit string of length n is palindromic.

b) Give an inductive proof that proves your algorithm in part (a) is correct.