Consider the following pseudo code. What is the total number of multiplications to be performed?

D = 2
for i = 1 to n do
   for j = i to n do
      for k = j + 1 to n do
           D = D * 3

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?

A canonical set of items is given below

$$\eqalign{ & S \to L. > R \cr & Q \to R. \cr} $$

On input symbol < the set has

Which one of the following is FALSE?