analyse the run time of the following code fragments. write the result of your analysis in Big O notation. Assume a big enough value for N

(d) for (int x 0; x n x++) for (int y x y n; y++) System.out.print