Please answer for the above questions.

(2) For each of the above languages, draw the simplest state diagram of an NFA that realizes it. (e) E = {x|every odd position of c is 1}. (f) F = {:12 contains even number of 0's }