Write a regular expression that generates the following language and then convert the expression to an equivalent NFA. Assume alphaber is {0, 1}

{w | w contains an even number of 1's between every two consecutive 0's}

Example (please note, NFA is not for given regular expression, is just an example):

(d) Language 1 (R)- w has length at least 3 and its third = {0,1} Rbe the regular expression generating L(R) R can be given as R = 0 * symbol is a 0} over the alphabet