PLEASE ANSWER WITH CLEAR EXPLAINATION WITHOUT COPYING OTHER ANSWERS!!

Let S = {0,1}. Consider the language L containing all binary strings in which either the second-last or the third-last bit is 1. (a) Give a 4-state NFA M that accepts L. (b) Convert M to a DFA using the subset construction. Show the tabular construc- tion, and draw the transition diagram of your DFA