Please write the answers clear and easy to be read and please sipirt the answers so It would be in order Problem 1 (5 points). Build an NFA with four states that recognizes the following lan- guage: fw: w contains the substring 001) Problem 2 (5 points). Build an NFA with two states that recognizes the following lan guage: w: w Problem 3 (5 points). Build an NFA with three states that recognizes the following reg- ular expression: 0*1 Problem 4 (5 points). We showed in class how to find the complement of a language by swapping the accepton-accept states of a DFA. Show that this does not work, in general, with NFAs