•  

Consider the following Java program (where n = a.length, and we assume that n 5): 1 void duplicatePrint (int[] a, int n) { 2 for (int i = 0; i < n; i++) { 3 4 8 9} } for (int j = 0; j < i; j++) { for (int k = 0; k < 5; k++) { System.out.println(a[k]); } } Determine the most accurate asymptotic upper bound of the above program, using the big-Oh notation. You must show in detail how you derive your answers. Without a convincing derivation process, you will not receive partial marks.