Let R = ( ( 0*1 U 10 )1 ). Use the construction from the proof of Lemma 1.55 (given any regular expression, we can construct an NFA that recognizes the described language) to construct an NFA such that L(N) = L(R). Apply the construction literally (do not optimize the resulting NFA-keep all those E arrows in the NFA). You should only draw the final NFA