5. Consider the following languages over the alphabet = {a,b): For each of the above languages, prove or disprove its regularity 6 (a) Using the closure properties of regular languages and that the language (a" 2is not regular, prove that the language L = {w E {a,b)' I (w)#b(w)) is not regular b) Note: s w be given for correct oral presentation of the following problem to the instructor by the due date; written solution will not be graded/accepted Prove that the above language L is non-regular by a direct application of Pumping Lemma