Additional Question 8-7: Suppose that you are trying to prove that the language atbsced is not regular. To do a proof by contradiction using the pumping lemma, you must pick a string that meets certain criteria. * Which of the following strings meet those criteria and if not, why not? o ambmcmdm o abomd o ambemd o abemdm o ambmcd o abcd O am+2 o a2b3c4dm+(2+3+4) m+(2+3)