For any algorithm for which we properly understand the running time analysis, the upper & lower bound will always be the same. (T or F)
0
0
0
0
0