Made easy test series

Question

Consider the following problems and select the problem which is recursively enumerable but not recursive. (MSQ type)
1 . Whether a given Turing machine accepts non-empty language.
 2. Whether a given Turing machine accepts finite language .
3. Whether a given Turing machine accepts at most 10 strings
4. Whether a given Turing machine accepts at least 10 strings.

Comments

Only 1?

---

1 , 4?

---

answer given is 1 and 4 , can you elaborate the reasons for it

---

https://gateoverflow.in/30890/please-explain (1).

https://gateoverflow.in/66/consider-the-following-languages(3,4)

For 2. Tyes={a} Tno=(a+b)*

Tyes$\subset$Tno. (Part 2 Rice theorem https://gatecse.in/rices-theorem/ ) So Not re.