Question 4. (20+5 points) Construct a DFA with alphabet = {a,b,c} for the following language: L = (a Ub)* U (a Uc)* U (buc)* Hints: Each component represents the strings that consist of at most two of the three symbols in the alphabet. Having all three symbols is not allowed in any string. After the first symbol is seen possibly multiple times, there are two possibilities for the next symbol. The machine should not have any nondeterministic transitions. This means there cannot be any 1-transitions, and there cannot be multiple transitions for any symbol at a particular state. Remember to double check your machine to make sure it is deterministic. Remember to double check your machine with a few strings that should be accepted and a few strings that should be rejected. Explain the DFA by writing what each part does or what each state corresponds to (5 points)