Provide NFSA (or NFSA with e-moves if you prefer) for the following languages 1- L={w E {0,1}* | w contains 1010} (using only 5 states) 2- L= { } by using only one state 3- L= {w E {0,1}* | w contains any number of Os followed by any number of 1s followed by a non-empty sequence of Os.} using only 3 states