(C language) Assume that each of the expressions below gives the processing time () spent by an algorithm for solving a problem of size . Find the dominant term(s) having the steepest increase in and specify the lowest Big-O complexity of each algorithm.

Expression Dominant Term(s) O(..)

0.001 log₄ + log₂(log₂ )

³ log₂ + (log₂ )²

0.01 + 100³

0.1 + 4^1.5 + 2.5^1.5

3 log₈ + log₂(log₂(log₂ ))