Alphabet = {0,1}. (a) are the following languages regular or non-regular? (b) if your answer is regular, please provide either a DFA, NFA or regular expression (choose only one) that recognizes the language. If your answer is non-regular, please prove it by contradiction via Pumping Lemma. 1. X = {0"1" m, n > 3 and m=2n} 2. Y = {rrrer* and | |