The following th regular expression:

a$)(1(1|))$

b$)0**101**100**11**011**$

$1-$ Construct non deterministic finite automata $($NFA$)$ for part a and $b.$

$2.$ Sho whether the following the input digit:

$0101110101$

$01011161$