Select all that is true of "Big-O" notation and measurements. It is generally a better measurement than estimating the "average expected time". It is generally a better measurement than "best case time". It represents a "lower bound" to an algorithm's time cost. It is generally a much better measurement than estimating "worst case time" It simplifies representation of algorithmic complexity. It represents an "average expected time" of an algorithm's time cost. It is a precise representation of algorithmic complexity. It represents an "upper bound" to an algorithm's time cost