1 of 3

reducing the halting problem to this

enter image description here

I think the first language is decideable, as the input string is of finite length and you can check every character in the string.

However, my intuition says the second language is undecideable. This would be like checking if a TM is equal to a TM that decides L1.

Am I correct? And if so, how should I proceed to reduce the halting problem to L2?