Prove using the definition of Big-O for each.

PROBLEM 4 Rank the follwoing time bounds. That is write them as fi, f2, ..., fo and show that fi = 0(fi+1) for all 1-i-5 n log(n 100 n3 log(n)+ 1000 1024n2+2n 45