Tessellate S.T.E.M.S - Computer Science - College - Set 1 - Problem 4

Which of the following languages are recursive?

1. {<T> : T is a turing machine with 13 states}
2. {<P,G> : P is a push-down automaton and G is a context-free grammar representing it}
3. {<P, R> : P is a push-down automata and R is a regular language and R is contained in the language of P}
4. {<T,w> : T is a turing machine and T accepts all but one prefix of w.}
5. {<P,w> : P is a push-down automaton and P accepts all but one prefix of w}

This problem is a part of Tessellate S.T.E.M.S.