（是非題）If a program has the computational complexity $\Omega(X(n))$, where $X$ is an exponential function of the program input size $n$, then the program must also have the computational complexity $O(X(n))$.