The following questions concern languages composed of strings over the alphabet ={a,b}. If you're using ITE, you might find https://www.cs.unc.edu/ otternes/comp455/fsm_designer/ useful. No justification is required for parts (a)-(c). (a) Draw a DFA that decides the language of strings that match the pattern a(bb)a, i.e., strings that begin and end with the character a, with zero or more copies of bb in between. (b) Draw a DFA that decides the language of strings that end with b. (c) Draw a DFA that decides the language of strings that match the pattern ab or the pattern bba, i.e., the string either (i) starts with a and then has zero or more b s (and nothing more), or (ii) starts with bb and then has zero or more as (and nothing more). Hint: Your answer should have less than 6 states. (d) What language is decided by the following DFA? Briefly explain your reasoning