Give an informal description of a pushdown automaton that accepts the language L = {w {a, b, c} | N a (w) = N b (w) or N b (w) = N c (w)}, where N a (w) stands for the number of letters “a†in the string w. Clarify your construction by describing how your automaton accepts “cbbacbc†and rejects “cabcbcâ€. Solution cbbacbc: the string is accepted by the automata because as per the given condition it satisfies the number of b\'s and number of c\'s are equal in the string.so it is accepted by the language cabcbc: the string is not accepted by the language because itdoes not satisfy any of the situation that is the number of a\'s=number of b\'s in a string or the number of b\'s=number of c\'s in a string. .