Don't Use Chatgpt or AI Tools. The answer should be handwritten. Don't

copy paste other chegg answer.

Instructions:

For each automaton, draw the state diagrams clearly.

Write out the formal definitions $($ Q : set of states, $$ : input alphabet, $$ : transition

function, qo: start state, F : set of accept states$).$

For conversions $($NFA to DFA, $-$NFA to DFA$),$ show the intermediate steps

clearly.

For DFA minimization, show the partitioning process step$-$by$-$step.

Submit your work in a neat, organized manner, including all required tables and

diagrams.

Part $1.$ NFA $($Non$-$deterministic Finite Automaton$)$

$($a$)$ Create an NFA that accepts the language of all strings over $\{a,b\}$ that start

with $\text{'}$ab$\text{'}$ and end with $\text{'}$ba$\text{'}.$

$($b$)$ Construct an NFA that recognizes the language of all strings over $\{0,1\}$

that contain the substring $\text{'}101\text{'}.$

$($c$)$ Draw an NFA that accepts the language of all strings over $\{a,b\}$ that have

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

Please answer the following questions as soon as possible by showing all the

processes and strictly following the instructions. If you follow the instructions and

do all the work, then I will give like your answer. $[$Hand Written State Diagrams

must clear$]$