really need help thank you, this is all i got.

Let L be the language of all strings over {0,1} containing 11. a) Give a regular expression that defines L. b) Give a NFA with 3 states that accepts L by completing the following table: 0 1 ->i 9 t-> c) Convert the NFA to an equivalent DFA using subset construction by completing the following table (indicate the initial state and accepting states): 0 1 {i} {9} {t} {i,q} {i, t} {q, t} {i, q, t} d) Is the DFA obtained by the subset construction in c) a minimum-state DFA? If yes, justify it. If not, minimise it