In JAVA:

Question1 1 pts Consider the following Java code: public static int findBiggestProduct(int] a) int x0 for (int i = 0; i x) x = a[i] *a[j]; return x; Which of the following is the best characterization of its running behavior (e.g. T(n)-the number of CPU cycles executed by running findBiggestProduct given an array of n random ints) using O-notation? HINT: If you aren't sure, you could try timing and graphing the code. Be sure to take a look at these slides: 06 O Notation.pptx. The Analysis section of the text could also be useful: Algorithm Analysis O o(1) O O(n) O O(n2) O(n3)