What are the languages generated by the following two grammars? Consider S is the start variable. Question 15 Not yet answered Marked out of 2.00 P Flag question CFG1: S OX|1Y X-OX|Y|E Y-1Y|E CFG2: SOS|X X-1X/1 Select one: O a L(CFG1): {0M1" | m>0 or n20 }, L(CFG2): {0m1" | m>0 and n>0} O b. L(CFG1): {OM1" | m>0 and n>0 }, L(CFG2): {OM1" | m>0 or n>0} oc L(CFG1): {OM1" | m>0 and n>0 }, L(CFG2): {0M1" | m20 or n>0} od L(CFG1): {0"1" | m>0 or n>0 }, L(CFG2): {OM1" | m20 and n>0} Next Question 14 Not yet answered Marked out of 2.00 P Flag question Consider the Push Down Automata (PDA), where Q = {qo, 91, 92}, { = {a, b}, r = {0, 1, $}, qo is the start state, qo is the accept state, and $ is the empty stack symbol. Consider the below transition function (), which of the following languages is accepted using the given PDA? 8 (go, a, $) = {91, 1$}, 1 is the top element of the stack. 8 (91, a, 1) = {91, 11} 8 (91, b, 1) = {92, E} 8 (92, b, 1) = {92, E} 8 (92, E, O) = {qo, E} Select one: O a. L = {am bm > 0, n >0} ob. L = { ab" | n>0} ocL = {am b" | M20, n 2 0} od L = {a" b | n20} Next