Question 5: Prove that the following languages are not regular. 2. {e* : n 0). (Remark: a3" is the string consisting of 3n many a's) uvu : u {a.bj", u, You can avoid using the Pumping Lemma by combining results about the closure under regular operations.)