style$=$"margin$-$left:$0$px;margin$-$right:$0$px;$">$Select all that is true of "Big$-$O$"$ notation.A$.$ Precise representation of algorithmic complexityB. Simplifies representation of algorithmic complexityC. Is generally better than estimating "worst case time"D$.$ Is generally better than estimating "best case time"E$.$ Is generally better than estimating "average expected time"F$.$ Represents an "average expected time" to an algorithm's time costG$.$Represents a "lower bound" to an algorithm's time costH$.$ Represents an "upper bound" to an algorithm's time cost