Give a PDA for the language L = {w {0, 1} | w = w R} (the language of all binary strings that are palindromes). (Hint: Do something similar to Example 2.18 in the textbook, the difference being that you also need to handle strings having odd length.) You must give an informal description (in English) of your PDA, and the diagram (your explanations should be in the style of the Example 2.18 from the textbook).