Problem $1$: $(20$ pts$)$

Build a TG that accepts string over alphabet $\{a,b\},$ that contains at least one a and end with

the substring bb$.$

Problem $2$: $(20$ pts$)$

Describe in English the language accepted by this transition graph.

Problem $3$: $(20$ pts$)$

Transform this Mealy machine into a Moore machine.

Problem $4$: $(20$ pts$)$

Transform this Moore machine into a Mealy machine.