design a pda that accepts

5. 125 points) Let L be the language consisting of the binary numerals for positive integers which are equivalent to 1 modulo 3. That is, L (1,100,111,1010....). Write a regular expression for L. To belp you, I show the minimun DFA for L in the figure below If your answer is unnecessarily long by a wide margin, I might mark it wrong even if it's right