Answer TRUE or FALSE.

The upper bound for a problem is defined as the upper bound cost for the worst algorithm that we know.

False
  • True
  • False

There is no limit to how bad someone might make an algorithm. So this can't make sense as a definition.