Regular Languages and Finite Automata questions

5. Give an NFA with the specified number of states for recognizing each language below. In each case, S = {0,1} (a) [7 pts) L1 = {w | w contains an even number of Os or contains exactly two 1s} with six states. (b) [8 pts] L2 = {w | the second symbols from both ends of w are the same }