Context free languages and Push-down automata

Consider the following languages. 

 Which one of the following statements is FALSE?

Let P be a regular language and Q be context-free language such that Q ⊆ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pⁿ qⁿ  | n ∈ N}). Then which of the following is ALWAYS regular? 

(A) P ∩ Q 

(B) P - Q 

(C) ∑* - P 

(D) ∑* - Q

Consider the language L1,L2,L3 as given below. L1={

| p,q

N} L2={

| p,q

N and p=q} L3={

| p,q,r

N and p=q=r} Which of the following statements is

NOT TRUE

?

Consider the languages - 
L1 = {0ⁱ1^j | i != j}. 
L2 = {0ⁱ1^j | i = j}. 
L3 = {0ⁱ1^j | i = 2j+1}. 
L4 = {0ⁱ1^j | i != 2j}.

S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of

Let L = L1∩L2, where L1 and L2 are languages as defined below:

L1 = {a^m b^m caⁿ bⁿ | m, n >= 0}

L2 = {aⁱ b^j c^k | i, j, k >= 0}

Then L is

The language L= {0ⁱ21ⁱ | i≥0 } over the alphabet {0,1, 2} is:

S --> aB        S --> bA
B --> b         A --> a
B --> bS        A --> aS
B --> aBB       A --> bAA

For the correct answer strings to below grammar, how many derivation trees are there?