(b) (8 points) Suppose that you have been able to prove that a problem H EN P has no polynomial time algorithm, and hence you have proved P EN P. Interestingly, you have not been able to establish that H is N P-complete. Given what you do know (i.e. H&P and H E NP ) can you conclude that if Q is an N P-complete problem, then Q&P? Explain your answer either way