2. [15 pts] Given an alphabet ={a,b,c}, list all strings from length 2 to 4 in the language L=b(a+b)a Assume the empty string is length 0 . 3. [15 pts] Draw a state transition diagram for the FA of regular language L(r) where r=(a+b)bb