Construct a DFA for the following regular expressions:

i$.1*01(0+11)*$

ii$.$ ab$*+$ c

iii. ab$*+$bc$*$

iv$.$ b$*+$ b$*$a$($ba$)*$

$3.$ Consider the following Finite State Machine,

a$.$ Give an equivalent Regular Expression for the above FSM$.$

b$.$ Design an equivalent automaton $($DFA$)$ to the above FSM with minimum number

of states.