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.

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

Here is the language from L₁:

L1 = {w| w starts with 0ⁱ1 and ends with 10ⁱ for some i 0}. Use at most 3 variables.