Turing machine on input w tries to move its head past the left end of the tape


Consider the language

$ $ L = \{ \langle M,w \rangle \mid \text{$ M$ on input $ w$ tries to move its head past the left end of the tape}\}. $ $

Prove whether L is decidable or not.

I tried to prove it as undecidable through reduction method but could’nt reduce the language halt to L inorder to prove that it is undecidable.