Prove that this language is decidable or undecidable
Yes, it is decidable.  There is a limited amount of input that any Turing machine could look at in ≤ 100 steps, so you can test a simulation of any given machine $M$ against all of those possibilities.