Recall that an NFA is a $5-$tuple N $=($Q$,\backslash$Sigma $,\backslash$delta $,$ q$0,$ F $)$ for finite set of states Q$,$ finite set of

alphabet characters $\backslash$Sigma $,$ transition function $\backslash$delta : Q $\backslash$times $\backslash$Sigma $->$ P$($Q$),$ start state q$0$ in Q$,$ and accept states F $$ Q$.$

Give a formal specification of your Question $5$ state diagram as an NFA.