QIThe expressions below (column 2, in the table) give the processing times T(n), needed by algorithms, for solving problem of size n. Write the dominant term (in the 3rd column) having steepest increase in n and write the tight big-Oh complexity in the fourth column. If more than one terms are dominant then indicate that clearly. Algorithm Complexity Expression Dominant Term 10 n log rn Tight Big-Oh On' log n) 5 n 10 n log n 100 n A1 A2 A3 A4 9 n 11 +1000 n+ 300 n log n nlog n n log n