$1\mathrm{.}97$ Provide NFAs accepting the following languages over the alphabet $=\{a,b\}.$

Note: For win${}^{**},in,$ we use $n_{}(w)$ to mean the number of letters $$ in $w.$

A$)L_A=\{\begin{array}{cc}\text{w}\text{i}\text{n}& {}^{**}\text{:}w\end{array}$ contains the substring ababa