Answer all questions. Unless otherwise stated, all the DFAs and NFAs in this homework use 2- 10,1j as the alphabet. 1. (50 point) For i-1,2 and 3, design NFAs Ni, such that L(N) - B5, where: (a) Bi-{w|w has an even number of O's, or, contains exactly two 1's) (b) ) B2- w every odd position of w is 1 (c) B3 - [w| all strings except the empty string and the string 11) (d) B4- [0j with two states. (e) B5 0*1*1+ with three states. Your answer should provide, for each NFA, a finite state diagram where all the states, the starting state, all of the accepting states and all the transitions (with the corresponding labels) are dis- played/drawn clearly. Show intermediate step(s) when applicable