Match the following :
$\begin{array} {clcl} \text{(i)}& \text{Regular grammer} & \text{(a)} & \text{Pushdown automaton} \\ \text{(ii)}& \text{Context free grammer} & \text{(b)} & \text{Linear bounded automaton} \\ \text{(iii)}& \text{Unrestricted grammer} & \text{(c)} & \text{Deterministic finite automaton} \\ \text{(iv)}& \text{Context sensitive grammer} & \text{(d)} & \text{Turing machine} \\ \end{array}$
- $\text{(i)-(c), (ii)-(a), (iii)-(b), (iv)-(d)}$
- $\text{(i)-(c), (ii)-(a), (iii)-(b), (iv)-(d)}$
- $\text{(i)-(c), (ii)-(b), (iii)-(a), (iv)-(d)}$
- $\text{(i)-(c), (ii)-(b), (iii)-(d), (iv)-(a)}$
