R-4.8 Order the following functions by asymptotic growth rate.

4nlogn+2n 2^10 2^logn

3n+100logn 4n 2^n

n^2 +10n n^3 nlogn

R-4.9 Give a big-Oh characterization, in terms of n, of the running time of the example1 method shown in Code Fragment 4.12.

R-4.10 Give a big-Oh characterization, in terms of n, of the running time of the example2 method shown in Code Fragment 4.12.

R-4.11 Give a big-Oh characterization, in terms of n, of the running time of the example3 method shown in Code Fragment 4.12.

R-4.12 Give a big-Oh characterization, in terms of n, of the running time of the example4 method shown in Code Fragment 4.12.

R-4.13 Give a big-Oh characterization, in terms of n, of the running time of the example5 method shown in Code Fragment 4.12.

1Returns the sum of the integers in given array./ 2 public static int example1(int arr) 3 int n-arr.length, total0; 4 for (int j-0: j