3. (15 pts) Construct npda's that accept the following languages on 2 = {a,b,c}. Give both a verbal explanation on how your npda works and the formal definition including the transition function and/or transition graph. You must use JFLAP. Submit the transition graph in the HW pdf and the JFLAP code file for each problem. a) L = { a+b2n - n 20} b) L = {w:na(w) = 2n,(w) } c) L = {wcwl:w e{a,b}*} 3. (15 pts) Construct npda's that accept the following languages on 2 = {a,b,c}. Give both a verbal explanation on how your npda works and the formal definition including the transition function and/or transition graph. You must use JFLAP. Submit the transition graph in the HW pdf and the JFLAP code file for each problem. a) L = { a+b2n - n 20} b) L = {w:na(w) = 2n,(w) } c) L = {wcwl:w e{a,b}*}