Classification of resources is contingent on determining the upper and lower bounds of minimum time required by what?
To show a lower bound of T(n) for a problem requires showing that no algorithm can have time complexity lower than T(n).