Expected case analysis

For each subproblem, compute the expected time complexity (asymptotic in n) of a run of the algorithm on integer array A containing uniformly a random permutation of the integers 0...n-1: Please provide a short but complete) explanation supporting your analysis. If you cannot find an asymptotically tight complexity, provide the best asymptotic bounds you can find. Oa. Wrong order finder [9 points] public static Pair wrongorderFinder(Integer[] A) { Random rand = new Random(); BOVOU AWNA while (true) { int ii = rand.nextInt(A.length); int jj = rand.nextInt(A.length); if (A[jj] (ii, jj); Ob. Magic maximum [8 points] public static Integer magicMax(Integer[] A) { Integer max=A[o], magic=1; for (int ii=0; iimax) { max=magic=A[ii]; for (int jj=0; j wrongorderFinder(Integer[] A) { Random rand = new Random(); BOVOU AWNA while (true) { int ii = rand.nextInt(A.length); int jj = rand.nextInt(A.length); if (A[jj] (ii, jj); Ob. Magic maximum [8 points] public static Integer magicMax(Integer[] A) { Integer max=A[o], magic=1; for (int ii=0; iimax) { max=magic=A[ii]; for (int jj=0; j