Categorize the following languages:

a)B = {aⁿbⁿcⁿ | n 0}.

b)SAT (satisfiability) problem.

c)Hamilton path problem.

d)HALT problem.

e)Co-HALT problem.

Turning-recognizable language(s): ----------------------------------------

Turning-unrecognizable language(s): ____________________________________

Turning-recognizable but undecidable language(s): ____________________________________

Class P problem(s): ____________________________________

NP-completeness problem(s): ____________________________________