Match the following $:$
$\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.}& \text{Context free grammar} & \text{i.} & \text{Linear bounded automaton} \\ \text{b.}& \text{Regular grammar} & \text{ii.} & \text{Pushdown automaton} \\ \text{c.}& \text{Context sensitive grammar} & \text{iii.} & \text{Turing machine} \\ \text{d.}& \text{Unrestricted grammar} & \text{iv.} & \text{Deterministic finite automaton} \\ \end{array}$
$\textbf{Codes :}$
- $\text{a-ii, b-iv, c-iii, d-i}$
- $\text{a-ii, b-iv, c-i, d-iii}$
- $\text{a-iv, b-i, c-ii, d-iii}$
- $\text{a-i, b-iv, c-iii, d-ii}$