Which of the following can we infer from the fact that factor is in NP but not known to be either in P or NP-complete, if we assume that P ≠ NP? a. There exists an algorithm that solves arbitrary...

Which of the following can we infer from the fact that factor is in NP but not known to be either in P or NP-complete, if we assume that P ≠ NP?

a. There exists an algorithm that solves arbitrary instances of factor.

b. There exists an algorithm that efficiently solves arbitrary instances of factor, but no one has been able to find it.

c. If we found an efficient algorithm for factor, we could use it to solve TSP.