The correct option should be opt 2...
1-the given option is wrong ,because the machine may or may not write $ (when it is in loop ).
4-equivalence problem of turing machine is undecidable..so wrong
2-all the string of length<=1050 ...so it is finite ...(decidable)
3-complement of option 2 (decidable)
Please correct if i am wrong!!