please answer all questionsDesign a finite automaton which accepts either empty string or any string that ends with b$,$

and also give a formal description of it$.$ Also draw its equivalent DFA

Construct a DFA that accepts all the strings on $\{0,1\}$ those containing the substring $101.$

Build a DFA for the following language:

is a binary string that has even number of $1s$ and even number of $0s$

Design an NFA $($non$-$deterministic finite automata$)$ to accept the set of strings of

$0\text{'}$s and $1\text{'}$s that either end in $010$ and have $011$ somewhere preceding, or

Construct DFA to accept end with either $ab,bc$ or $ca$

Construct DFA to accept $L=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{**}|w\end{array}$ has an odd number of a$\text{'}$s and

an even number of b$\text{'}$s$\}.$

Create an NFA that accepts strings over the alphabet $\{a,b\}$ where the number of $\text{'}$a$\text{'}$s is even and the

number of $\text{'}$b$\text{'}$s is odd.

Create an NFA that accepts strings over the alphabet $\{a,b\}$ where the substring "aba" does not occur.

Design an NFA that recognizes strings over the alphabet $\{0,1\}$ where the string contains at least two

occurrences of the substring $"010".$

Design a DFA that recognizes strings over the alphabet $\{0,1\}$ where the number of $\text{'}0\text{'}$s is divisible

by $3$

Design a DFA that recognizes strings over the alphabet $\{0,1\}$ where the string starts with $\text{'}1\text{'}$ and

ends with $\text{'}0\text{'}.$

Create a DFA that accepts strings over the alphabet $\{a,b\}$ where the number of $\text{'}$a$\text{'}$s is a multiple of

$3$ and the number of $\text{'}$b$\text{'}$s is a multiple of $2.$

Create a DFA that accepts strings over the alphabet $\{a,b\}$ where the string contains an even number

of occurrences of $"$ab$".$

Create a DFA that accepts strings over the alphabet $\{a,b\}$ where every $\text{'}$a$\text{'}$ is immediately followed