PLEASE!!!!

PLEASE BE SURE TO INCLUDE AN ACTUAL DRAWING!!!

I have to repost this question because somebody responded with a bunch of code with no instructions on where to put it.

Please also include builder notation and a list of possible options!

Thanks!

1. Construct a DFA for a language L1 which is a set of all strings starting with ' 1 ' over the alphabet {0,1} 2. Construct a DFA that accepts all strings of length 3 over {0,1}. 3. Construct a DFA that accepts any string that does not contain string aabb in it over {a,b}. Where DFA means Deterministic finite automaton. Please also include builder notation, transition diagrams and a list of possible options. Thanks