Are the languages accepted by the given finite automata equivalent? Use the algorithm discussed in module 3, decidability problems, to prove your answer, showing all steps for full marks.