please drawi it and answer both Question $4(10$ points$)$

a$)(7$ points$)$ Design an NFA $($by drawing the state diagram$)$ with the given input

alphabet as $\{0,1\}$ that accepts the set of strings that starts with $0$ and contain exactly

one $1.$

b$)(3$ points$)$ Find the regular expression that define the language accepted by the

NFA.