algorithm,turing-machines,np,np-hard,turing-complete

I) each NP problem can be solved in Exponential Time. Yes, this because it can be solved in polynomial time on Non Determinisitc Machine (definition of NP), and thus can be solved on a Deterministic Machine in exponential time. II) if P=NP then NP=NP-Complete. Yes, because if P=NP, "yes"...