Please, build a Finite Automaton $($FA$)$ to generate all strings ending with $1$ with

any combinations of $0\text{'}$s and $1\text{'}$s preceding the last $1$ Thus an empty string is not

generated, as there is always the last $1.$

Please draw a Finite Automaton with the following transition function

a$.a,1=>a$

b$.a,0=>b$

c$.b,0=>b$

d$.b,0=>c$

e$.c,1=>c$

Please, define the transition function for your FA designed for Question $1$

Build a Finite Automaton to generate all strings of $0\text{'}$s and $1\text{'}$s such that $0$ never

occurs before $1.$ Empty string is also generated. Please provide transition

function for this FA

Build a Finite Automaton to generate all strings of the form $1^m{0}^n,$ where $m$ is even

and $n$ is divisible by $3.$

Build a Finite Automaton with two states generating just one string.

Please draw a picture of each question will upvote thank you!