Problem 4 [30 pts] For each of the following languages construct an NFA with the specified number of states. For each case the alphabet is {0,1}. NOTE: You must provide the formal definition of the NFA, as well as its state transition diagram a) A1 = {w w ends with 10 with three states. b) A2 = {wl w contains substring 1011} with five states. c) A3= {w w contains an odd number of ls and exactly two 0s with six states