Let n$1,$ n$2,$ n$3$ be the three smallest digits occuring in your student ID that are greater than $1($that is$,$ greater or equal to $2)$ and all different. Eg$.$ if your student ID was $183205720,$ then you$$d have n$1=2,$ n$2=3$ and n$3=5.$ State clearly what your numbers n$1,$ n$2,$ n$3$ are. Let $=\{0,1\}$ be an alphabet. $($a$)$ Design an NFA that accepts all words over $$ with a number of $0$s that is divisible by n$1+$ n$2$ or a number of $1$s that is divisible by n$3.($b$)$ Design an NFA that accepts all words over $$ that start with a number of $0$s divisible by n$1,$ followed by a number of $1$s divisible by n$2,$ followed by exactly n$30$s$.$