I need help on B) thank you

a) What is a reduction? Briefly explain how this technique can be used to prove that certain problems are undecidable. b) Given Laccep={$$w | M is a Turing Machine that accepts input w} and Lhalt={ $$w | M is a Turing Machine that halts on input w} In the lecture, we have presented a reduction from Lhat to Laccept. Here assume that Laccept is undecidable, show that Lhalt is undecidable by informally describing a reduction from Laccept to Lhalt