Part A: Objective and short answer Questions 1. Which of the following is not equal to O(n2) ? a) (1010)n+13223 b) n1.978 c) n3/sqrt(n) d) 520n 2. Which of the given options provides the increasing order of asymptotic complexity of functions fl,f2,f3 and f4 ? f1(n)=2nf2(n)=n23f3(n)=nlognf4(n)=nlogn a.f3f2f4f1 b.f3f2f1f4 c.f2f3f4f1 d.f2f3f1f4 3. Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is always true? a) R is NP-complete b) R is NP-Hard c) Q is NP-Hard d) Q is NP-Complete