Please show your work and if you'd like to. I'd love a step by step

Problem 4 (1.5 points) Consider the alphabet E = {a,b,c}. (a) Design a DFA of three or more states, then recognize a finite language of your choice, L1, that includes 2 (i.e., 1 E Li). (b) Design a DFA of three or more state that recognizes an infinite language of your choice, L2. (c) Design a DFA that recognizes L2/L]