How to find a lower bound on the complexity of an algorithm?

Question

Algorithms

For example, here is the lower bound:


I can't understand how it is calculated.

Answer 1

You can see it here. Obviously, T(n) > n. Therefore, we can take n as the lower bound.