(A) is the correct answer!
i. Make a DFA to accept the language which contains the set of all strings over (0+1)* that have the sub-string 0001, it will have 5 states.
ii. find the complement of the machine made in step 1, it will have 5 states too! just convert final state into nonfinal and vice versa