For each of the following languages, make an NFA or DFA recognizing it$.$

$=\{a,b\}.L$ is the set of all strings of length at least $2$ whose next$-$to$-$last symbol is a $b.($Hint$.$ You need

four states.$)$

the third symbol from the end of $w$ is a $b.$

$=\{a,b,c\}.L$ is the language denoted by $a^{**}{b}^{**}{c}^{**},$ that is$,\{a^n{b}^m{c}^p|n,m,p0\}.$