I need the answer ASAP. Thank you

= = 1. Draw a graph with 5 vertices, ten edges and no cycles. (5 Points) 2. For S = {2,5,6,8} and T = {2,4,6,8}, compute IS N TI+ IS U TI (3 Points) 3. Draw a picture of the graph with vertices {v1, v2, v3} and edges {(v1, v1), (v1, v2), (v2, v3), (v2, v1), (v3, vl)}. (2 Points) 4. Find a grammar for the language L = {a, where n is even} (5 Points) 5. Find grammars for = {a, b} that generate the sets of: 1. all strings that start with at least 3 a's (5 Points) 2. all strings that start with a and end with b (5 Points) 6. Give a simple description of the language generated by the grammar with productions, S + aaA, A S, Sa (5 Points) 7. Give a dfa for the language L = {ab"a": n>3, m > 2} (5 Points) 8. For = {a, b}, construct a dfa that accepts the set consisting of all strings of even length. (5 Points) 9. Construct a DFA where all strings that contain a substring 000 are accepted, but NOT 0000, on the alphabet {0,1}. (5 Points) 10. For X = {a, b}, construct a dfa that accepts the set consisting of all strings with at least one b and exactly two as.( 5 Points) = =