theory of automata

Question.No.2:- In each case, find a string of minimum length in (0,1}* not in the language corresponding to the given regular expression. i. O*(10)*1* ii. 1*(011*)*0* ili. (1*+ 0*)(0*+ 1) 0*(1+01)*0* iv