Estimate the running time of the following program fragments (a big-O analysis). The following program snippet sorts an integer array int[] A- new int[n]. What is the order of running time for that in big-O notation? for inti o; mi nj-i for(ii1jnj++) if(A[ j ] 0, which value will be found the variable L2 after executing the following program snippet? The answer should be give as a function of n. Of which order is the running time of this program in big-O notation 2 while(i