$($a$)$ Suppose there is a Turing Machine that accepts all words of a

language L and loops forever or rejects all words not in L$.$ Is it true

that L is not recursive? Justify your answer.

$($b$)$ Draw a Venn diagram where you indicate the following classes of

languages:

Context$-$free

Recursively enumerable

Regular

Recursive