II. Problems Answer all questions. Unless otherwise stated, all the DFAs and NFAs in this homework use ={0,1} as the alphabet. 1. (50 point) For each i=1,2,3,4 and 5 , design a NFAs Ni, such that L(Ni)=Bi, where: (a) B1={ww has an even number of 0s, or, contains exactly two 1s}. (b) B2={w every odd position of w is 1}. (44) 4 Remark: In this question, we use the (c) B3={w all strings except the empty string and the string 11 } following convention: the position of (d) B4={0} with two states. a string w starts with position 0 . For (e) B5=011+with three states. symbol at position 0 (resp. 1, 2) of s is 0 in B2. In addition, we will consider the Your answer should provide, for each NFA, a finite state diagram empty string /B2. where all the states, the starting state, all of the accepting states and all the transitions (with the corresponding labels) are displayed/drawn clearly. Show intermediate step(s) when applicable