Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
Which of the following is the strongest correct statement about a finite language over some finite alphabet $\Sigma$ ?
- It could be undecidable
- It is Turing-machine recognizable
- It is a context sensitive language.
- It is a regular language.
- None of the above,