Intro to Algorithms

1.

1. (20 points) Rank the following functions by increasing order of growth. That is, find any arrangement g1,g2, g3,g4,g5,g6 and g7 of the functions satisfying g1=O(g2),g2=O(g3),g3=O(g4),g4=O(g5), g5=O(g6) and g6=O(g7) f1(n)=n2+100n2logn,f2(n)=(nn/2),f3(n)=(n4),f4(n)=n3/logn, f5(n)=2n,f6(n)=nlogn,f7(n) is the solution to f72f7=n