I need clear answer. Thank you

Exercise 2: Design an NFA that accepts the following language a) L-(wl w contains an even number of Os or contains exactly two 1's) (no more than 6 states) b) L (a", n 21(b"a m 20, k 20) (no more than 3 states) c) (ab, abc)* Exercise3: Find the DFA that is equivalent to the NFA in exercise 1), 2-b)