Question 2. Let -{ a,b,c]. Let L-{ w E l w-S1$2 Sk for k 0 and s,-xy, where each Xi consists of any number of a's (that is zero or more), and each yi consists of either the empty string or: bb followed by any number of repetitions of symbol c (that is zero or more) a) Prove that L is regular by designing a NFA N that satisfies the following constraints: N= (Q, , , qo, F) with IQ1-3 (that is N has exactly three states), = {a,b,c), F= {qo). Use a state diagram to show