give hand drowing graphs. if you draw the graphs in text i will give down vote. don't give text answer only hand written answer $.$ draw graphs for all the questions.

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

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

by a $\text{'}$b$\text{'}.$