Repeat: To show a lower bound of T(n) for a problem requires showing that no algorithm can have time complexity lower than T(n).
To show a lower bound of T(n) for a problem requires showing that no algorithm can have time complexity lower than T(n).