5. (15 points) Give the running time in Big-O notation for each of the code segments below. Assume that n=A.length=B.length. If you want partial credit, include a brief explanation for your answers. (a) //A and B are arrays of integers for this part int max = A [0]; for (int i=1; i max) max = A[i]; int count = O for(int i=0; i max) count++; System.out.println(count); (b) //A is an array of integers for this part int half www. A. length / 2; int count = 0; for (int i=0; i = 1/2) A[i] = 0; } (c) //A is an array of Strings for this part ArrayList list = new ArrayList (); for (int i=0; i