This question asks about the following Pushdown Automaton (PDA). e,…

Question Answered step-by-step This question asks about the following Pushdown Automaton (PDA). e,… This question asks about the following Pushdown Automaton (PDA).e, e, –> $            1, 0, –> e–>S————-> A —————> B   1, 0, –> e         0, e, —> 0          e, $, —> $Part 2a (0.25pts)Does there exist a string of length n > 1 where n is odd that this PDA will accept? If such a string exists, then give example of such a string.               Part 2b (0.25pts)Does there exist a string of length n > 2 where n is even that this PDA will reject? If such a string exists, then give example of such a string.Part 3 (0.5pts)Some string of length 6 is accepted by this PDA. At most, how many 1s could be present in this string? What is the least number of 1s that could be present in the string? Engineering & Technology Computer Science CPSC MISC Share QuestionEmailCopy link Comments (0)