For sigma = {a, b, c, } given a regular Expression for all strings starting with "ab" or "ba" What language would be generated with those productions? Draw a DFA for L = {w elementof {a, b} *: |w| mod 3 = 1} Suppose we design a vending machine using a DFA to process the Coins. The machine accepts exactly 25 cents Let alphabet = {n, d, q}, meaning ", dime, and quarter". Write a DFA to accept any sequence of coins that adds up to 25 cents exactly. Find an NFA that accept the set {a^2} union {b^: N greaterthanorequalto 2}