Q. Suppose that a problem A is known to have a polynomial-time verificationalgorithm. Which of the following statements can be deduced. (Solved)
1. A is in NP.
2. A is in NP but not P
3. A is in both NP and P.
4. A is NP-complete.
- b. A is in NP but not P