2) Translate to an algorithm the method of converting any NFA to a DFA 3) Construct a CFG for the language L = {amb"cPd9 : m+n=p+q}