In the P vs. NP question, P represents (i.) and NP represents (a) A task that is efficiently solvable (b) A task for which a solution can be efficiently checked (c) A task can be used for other purpose (d) A task for which other tasks can replace Which of the following statements may not be correct regarding NP Completeness? (a) NP completeness identifies a set of computational problems that are as hard as NP. (b) A problem being easy to solve in the realm of NP completeness cannot mean any other problem is also easy to solve. (c) Showing that a problem is NP-complete provides evidence of its intractability. (d) Demonstrating the NP-completeness of computational tasks is a central tool in indicating hardness of natural computational problems. Which statement is correct regarding analysis of algorithms? (a) For an optimal algorithm, estimation of the running time is essential. (b) Pseudo-codes are first used to roughly design and implement the algorithms. (c) Theoretical and asymptotic Analysis are two representative Running time analyses. (d) All of above