A portion of your program includes the loops shown in the co…

A portion of your program includes the loops shown in the code snippet below to examine the elements of two arrays, arr1 and arr2, both of length n: int matches = 0; for (int i = 0; i < arr1.length; i++) { for (int j = 0; j < arr2.length; j++) { if (arr1[i].equals(arr2[j])) { matches++; } } } What can you conclude about the running time of this section of code?

The method below implements the exponentiation operation rec…

The method below implements the exponentiation operation recursively by taking advantage of the fact that, if the exponent n is even, then xn = (x n/2)2. Select the expression that should be used to complete the method so that it computes the result correctly. public static double power(double base, int exponent) { if (exponent % 2 != 0) // if exponent is odd { return base * power(base, exponent – 1); } else if (exponent > 0) { double temp = ________________________ ; return temp * temp; } return base; }