i) Convert the regular Expression into Finite automata ( 1 + 1 + 0 ) 010101 ( 1 + 0 + 0 ) 101010 Using direct and subset construction method and convert the finite automata into Regular Expression using equation ,Ardens and state elimination methods ii) Draw the DFA and NFA and convert the NFA into DFA for the given string using Myhill method and equation method for the any string with "high" as front word.