Recursion Theory Classification (Theory of Computation)

You need to classify in the Recursion Theory the following sequence of sets and their complements, that is, determine for each set in the sequence and its complement whether it is recursive, recursively enumerable (r.e.), and then classifying in creative, or productive.

Giving a formal proof of the classification is a must.

In the figure, I gave an example. If you can solve it correctly, I'll give you more.