Which of the following statements is not correct?
- Every recursive language is recursively enumerable
- $L=\{ 0^n \: 1^n \: 0^n \mid n=1,2,3, \dots \}$ is recursively enumerable
- Recursive languages are closed under intersection
- Recursive languages are not closed under intersection
