3. Assume that each of the expressions below gives the processing time T(n) spent by an algorithm for solving a problem of size n. Select the dominant term(s) having the steepest increase in n and specify the lowest Big-Oh complexity of each algorithm (27 points). Dominant Term(s) 0(...) Expression 5 + 0.001 n3 + 0.025 n 500 n + 100 n1.5 + 50 n log 10 n 0.3 n + 5 n1.5 + 2.5 n4.75 n log n + n (log n) n log3 n + n log n 3 log: n + log n 0.01 n log n + n (log n)- 100 n log3 n + n + 100 n 3 logs n + log log log n