This is for Data Structures and Algorithm Analysis. Below are two questions about big-o notation. Please help, Im a bit lost.

3. Order the following functions by growth rate in order from smallest to largest N log N 2/N 2N N1.5 N2 N log (N2) NlogN N/2 37 N3 6. An algorithm takes 0.5 ms for input size 100. How large a problem can be solved in 1 minute if the running time is the following? a. linear b. quadratic c. cubic 2 1 00