Automata and formal languages

I. Translate the following NFA M into a DFA M, such that L(M") and provide a regular expression for L(M) L(M), ql 0 0 2 0 2. A C-program is deterministic. But I can easily expand it to be a nonde- terministic program. For instance, consider the following program: Char c; 1. Read(c); 2. if c-- 'a' or c-- 'b' then goto 1 or goto 3; goto 1 Abort; 3. if c-- 'a' 5. Halt. Tell me the regular expression for all the input sequences of characters that will make the program enter the last statement Halt