Consider the regular expressions,

$(0{)}^{*}1+(1{)}^{*}0$

a$)$ Construct $-$NFA using Thompson construction.

b$)$ Construct DFA using QNO $1($a$).$

c$)$ Is the DFA obtained in QNO$1($b$)$ minimized? If not minimize it table filling methos