need help with a discrete mathematics question

need help with question 5.

e) Give a matching upper bound (using 0-notation) for the time complexity of the algorithm Problem 5 Assume that each of the expressions below gives the processing time T(n) spent by an algori for solving a problem of size n. Select the dominant term(s) having the steepest increase in n specify the lowest Big-Oh complexity of each algorithm. and s+ 0.001 ns + 0.025n 0.00 500n+100n1+ 50n logi0 n 0.3n+5n1+2.5 n175 n2 log, n+n(log n) n loga n+ n log2 n 3 logs n+ loga logz logz n 100n + 0.01n 0.01 n + 1 00n2 2n + no5+0.5125 0.01n log n+ nlog, n) 100n loga n+n+ 100n 0.003 log, n+ log: logn VB N M