Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R
Assertion A: $L=\left\{a^{n} b^{n} c^{n}: n \geq 0\right\}$ is accepted by a linear bounded automata.
Reason R: Linear bounded automata's recognize exactly the class of context sensitive languages.
In the light of the above statements, choose the most appropriate answer from the options given below
- Both $\mathbf{A}$ and $\mathbf{R}$ are correct and $\mathbf{R}$ is the correct explantion of $\mathbf{A}$
- Both $\mathbf{A}$ and $\mathbf{R}$ are correct but $\mathbf{R}$ is NOT the correct explanation of $\mathbf{A}$
- $\mathbf{A}$ is correct but $\mathbf{R}$ is not correct
- A is not correct but $\mathbf{R}$ is correct
