Convert the Mealy Machine from problem 2(b) into a Moore Machine.
Prove by induction that a Mealy Machine that enters q0, q1, ..., qn
and outputs b1, b2, ..., bn is equivalent to a Moore Machine that
enters states [q0, b0], [q1, b1], ..., [qn, bn] and outputs
b0, b1, ..., bn