# if P=NP, then is E=NE?

If the computational complexity class P equals to NP, does the complexity class E equal to the class NE?

E is defined as $DTIME(O(2^{O(n)}))$ NE is defined as $NTIME(O(2^{O(n)}))$

Thank you very much.

-