Draw Deterministic finite automata (DFA) for the above-given languages respectively.

FAKE experts stay away.

(7) {W:W is a binaeny string containing an odd number of q's } (2) {: is a binary rlring containing 101 as 0 rubsteung y (3) {w : the length of w is dinirible by three } (4) {:110 is not a substeung of w} (5) {C:w contains the substering 1011} (6) \{ cs: os contains an even number of o's or exactly two n's }