Java, Computer Science

EX 2.1. What is the order of the following growth functions? a. 10n2 + 100n + 1000 b. 10n3-7 c. 2n + 100n3 d. na log n EX 2.2. Arrange the growth functions of the previous exercise in ascending order of efficiency for n = 10 and again for n = 1,000,000. (calculate the result for both n=10 and n=1,000,000 for each) EX 2.3. The following code finds the largest element in an unsorted array of integers. What is the time complexity of this algorithm? int max; if (intArray.length > 0) { max = intArray[0]; for (int num = 1; num max) max = intArray[num]; System.out.println (max); } else { System.out.println ("The array is empty."); } EX 2.4. Determine the growth function and order of the following code fragment: for (int count = 0; count