Hello Professor,
In part (a), can we argue that since the Turing Machine accepts the input in precisely 5 steps, it operates in polynomial time? Given that languages accepted in polynomial time by a Turing Machine are decidable, can we then conclude that Language 1 is decidable?