Answer TRUE or FALSE.
The lower bound for a problem is defined as the cost of the best algorithm that we know.
Just because we know some algorithm does not mean that there does not exist some better algorithm.
The lower bound for a problem is the best that an algorithm COULD be, not just what we happen to know.