Consider two programs with time complexities being $$T_1=O(2^n)$

Consider two programs with time complexities being $$T_1=O(2^n)$$ and $$T_2=O(n)$$. then program 2 must run faster than program 1. ~@[](2)

答案：FALSE