2. (75 points, 10+5 points each) Build a DFA that accepts the described language in each part. The alphabet is 5 = {a,b,c} for Part (c) and S = {a,b} for the other parts. Explain how the machine works. You should explain the machine at a high level, by describing the semantics of states or groups of states. You can put labels on sections of the machine and explain those sections. Writing the transition function in English does not provide information that is not available in the drawing. Thus, it is not a valid explanation. The drawing of each machine is 10 points. The accompanying "comments are 5 points. No points will be given if an explanation is not provided. (a) The empty set. (b) The empty string. (e) The language represented by the regular expression: a*b*c* (d) The strings that contain at least one a and end in bb. (e) The strings that start and end with the same symbol. Strings 1, a and b are in the language