Question 8 Let = {a,b, c} and let L be a regular language defined on Show that the language defined below is a regular language. Upload Choose a File Question 9 Let = { a, b, c} and let L be a regular language defined on .LetL be defined as follows: Show that there exists an algorithm to determine whether to E L, for any given w E * Upload Choose a File Question 10 Let = {a, b, e). Use the Pumping Lemma to show that the language L defined below is not regular Upload Choose a File