Consider the following problems L(G) denotes the language generated by a grammar G. L(M) denotes the language accepted by a machine M.
I. For an unrestricted grammar G and a string w, where  L(G).
II. Given a Turing Machine M, whether L(M) is regular.
III. Given two grammars  and  whether 
IV. Given an NFAN, whether there is a deterministic PDA P such that N and P accept the same language.
Which one of the following statements is correct?