I am reading a free book on algorithms
and on page 13 it says
"Compare this to the recurrence relation for Fn: we immediately see that T(n) ≥ Fn"
I do not understand how they know that T(n) ≥ Fn
if someone could explain it to me it would be much appreciated. here is a picture of the information needed