Create state diagrams that show stack operations.

2. Give a PDA for each of the languages (where n, m, k 2 0.) You only need to show a state diagram which also shows stack operations. (b) L = {W E ta, b)" l start and end symbols in w is different and lul 1, } (c) 1 = {UE {a, b}. I w = w, that is, w is a palindrome. } (f) L-(ambng 1 k = n + m). (h) L = {w e ta, b, c)" I na(w) + re(w) = 2ne(w)} 2. Give a PDA for each of the languages (where n, m, k 2 0.) You only need to show a state diagram which also shows stack operations. (b) L = {W E ta, b)" l start and end symbols in w is different and lul 1, } (c) 1 = {UE {a, b}. I w = w, that is, w is a palindrome. } (f) L-(ambng 1 k = n + m). (h) L = {w e ta, b, c)" I na(w) + re(w) = 2ne(w)}