TNB: HIS IS A COMPUTER SCIENCE COURSE$>$ SPECIFICALLY THEOROTICAL COMPUTATION

instead of typing the FSA drawing, can you draw them out with a pencil or something to make it easy to read. The first solution was hard to understand.

PLEASE iI NEED THE SOLUTION URGENTLY TO SUBMIT IN AN HOUR. THANK YOU

$2.$ For each part below draw an FSA accepting the indicated language where the alphabet is $($a$,$b$)$:

a$.$ the language of all strings containing exactly two a$\text{'}$s$.$

b$.$ the language of all strings containing at least two b$\text{'}$s$.$

c$.$ the languauge of all strings thta do not end with ab$.$

$3.$ Let M$1$ be the FSA accepting the language described in part b of the previous question. Let M$2$ be the FSA accepting the language described in part c$.$ Draw FSA's for the following language:

a$.$ the union of the two languages accept in parts b and c$.$

b$.$ the intersection of the two languages from b and c$.$