which of the following statements are true? (a) any np problem can be solved in polynomial time by a non-deterministic algorithm; (b) halting problem is np; (c) np-complete problems are not in np-hard problem set; (d) if a polynomial time algorithm is found for a np-complete problem, all np-complete problems are solvable in polynomial time; (e) none of the above.