Convert the following finite automata into equivalent regular expressions. 1. M=(Q, 2, 5, 90, F) with Q={q0, 91, 92, 93, 94} = {0, 1) F={4}, and 5 is defined by 0 1 qo qi 92 93 94 qi qi 2 93 94 qi 93 94 94 92 2. M=(Q, E, 5, 90, F) with Q={qo, q1, 9293} 2 = {0, 1) F={ 93}, and delta is defined by 5 0 1 qo 92 qi qi 91 93 92 92 qi 93 93 93