Match the pairs in the following:

List - I

(A) Small talk
(B) LISP
(C) Prolog
(D) VAL

List - II

(p) Logic programming
(q) Data flow programming
(r) Functional programming
(s) Object-Oriented programming

Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:

State whether the following statement is TRUE / FALSE.

All subjects of regular sets are regular.

State whether the following statement is TRUE / FALSE.

A minimal $$DFA$$ that is equivalent to an $$NFDA$$ with $$n$$ modes has always 2ⁿ states