ef problem$5()$:

$"""$

L$\_5=\{$w in $\{0,1\}*|$ w has exactly one $0,$ an odd # of $1$s$,$ or both$\},$ five states

can you build a finite state machine for this here is an example of one def example$()$:

$"""$

L $=\{$w in $\{0,1\}*|$ w contains $101$ or $11$ as a substring$\}$

$"""$

Q $=\{"$q$\_0","$q$\_1","$q$\_2","$q$\_3"\}$

Sigma $=\{"0","1"\}$

delta $=\{$

$("$q$\_0","0")$: $\{"$q$\_0"\},$

$("$q$\_0","1")$: $\{"$q$\_0","$q$\_1"\},$

$("$q$\_1","0")$: $\{"$q$\_2"\},$

$("$q$\_1","\_")$: $\{"$q$\_2"\},$

$("$q$\_2","1")$: $\{"$q$\_3"\},$

$("$q$\_3","0")$: $\{"$q$\_3"\},$

$("$q$\_3","1")$: $\{"$q$\_3"\}$

$\}$

q$0="$q$\_0"$

F $=\{"$q$\_3"\}$

return NFA$($Q$,$ Sigma, delta, q$0,$ F