Question shown: Let A = {M1,M2,M3,.} be a semidecidable set of Turing machine descriptions.

I need help regarding turing machines.

Question shown:

Let

A = {⟨M1⟩,⟨M2⟩,⟨M3⟩,...}

be a semidecidable set of Turing machine descriptions. Show that there exists a de- cidable set B of Turing machine descriptions which has the same set of associated languages L(Mi) as A.

Hint: Show how you can pad the description ⟨M⟩ of a Turing machine M to get an equivalent Turing machine, but with a much longer description.