A) Convert given NFA to DFA B) Design a pda that recognizes the language L, for binary strings. L= {w=w contains at least three 1s} Convert the following CFG with start symbol S into chorsky normal form: S-> ASA | A| A-> 11 | A C)