Answer TRUE or FALSE.
For all algorithms, if we completely understand the running time analysis, then the upper bound and lower bound will be the same.
Upper and lower bounds are only different when we do not completely understand the cost for the algorithm.