3. (PDAs) Draw state diagrams of PDAs (with as few states as you can) that recognize the following languages. Write algorithmic descriptions for your PDAs.

(b) The language L₂ from Problem 2(b): (i) diagram; (ii) algorithmic description.

Here is the language L₂:

L2 = {w | w = w^R which means w is a palindrome} Recall that w^R represents string w written backwards. Use at most 2 variables.