3) [5] True or False: i) --LREG= LNPDA (i.e., the set of languages accepted by nondeterministic pushdown automata is the regular languages.) ii _Given an arbitrary context-free language L, it is possible to make a deterministic Turing machine to accept L. iii)_LDTM:LREC (i.e., the set of languages accepted by Turing machines is the decidable languages.) v)NFLoFa (i.e, the set of languages accepted by deterministic finite automata is a proper IV subset of the languages accepted by nondeterministic finite automata.) v) --LDPDA = Lcr(ie, the set of languages accepted by deterministic pushdown automata is the context-free languages.)