Appreciate with dumbsup need solution for all questions

4. For each of the following, is the question:

Decidable or undecidable?

Turing-acceptable (recursively enumerable) or not T-acceptable?

a. { M | M is a TM and M accepts 11011 in 10 or fewer steps }

b. { M | M is a TM and M accepts 11011 in a finite number of steps }

c. { M | M is a TM and M makes at least 10 moves on the string 11011 }

d. { M | M is a TM and M enters either qaccept or qreject 11011 }