Draw the simpliest state diagram of an NFA that realizes it. Assume = {0,1}: (a) A= {xx ends with 001}. (b) B={xx contains 001}. (c) C = {xx contains neither 01 nor 10 as substring}. (Hint: think of the complement of this language.) (d) D= {xx has length at least 3 and the third symbol is 0}. == (e) E {x every odd position of x is 1}. (f) F= {xx contains even number of 0's }. Describe each of the above languages using regular expressions.