For each part below, give the formal definition and state diagram for a deterministic finite automaton (DFA) that accepts the language specified. (please don't include dead states and also, make sure you write the formal definition for each part along with the state diagram DFA)

1. For each part below, give the formal definition and state diagram for a deterministic finite automaton (DFA) that accepts the language specified. 20 points a) L-wE 0,1w at most three Os b) L2we 0,1 w starts with a 1 and its number of 0s is a multiple of three c) L, b) d) L, is the empty set. Let X-(a.b.c\. ,a, baa, ca