7.a) Rank the following time bounds. That is write them as f1, f2,..., fe and show that fi = O(fi+1) for all 1 i 5 ( You may use limit lemma theorem) 3n +6n n log(n1000) 7n log(n) + 1000 3 .6 1024n + 4n+ 460 7b.) Prove that k(n)=n+3n is (n). 1