Construct a finite automata for the following regular expression

a$)(11+0{)}^{**}(00+1{)}^{**}$

Consider the following NFA transitions with states $p,q,r,s(p$ is the initial state and $s$ is the final state$)$

whose transition function is $(p,0)=\{p,q\},(p,1)=p,(q,0)=r,(q,1)=r,(r,0)=s,(s,0)=s,(s,1)=s$;

Find the corresponding DFA as explained in class.