Let the processing time T(n) of a certain optimisation algorithmdepend on the problem size n as follows: T(n) = 0.01n2log2n + 6n(log2n)2 . Determine the“BigTheta” time complexity bounds for this algorithm, decidewhether the statements “T(n) is O(n3 )” and “T(n) isΩ(n2 ) hold for this algorithm, and prove yourdecisions.
Expert Answer
An answer will be send to you shortly. . . . .