java language

QUESTION 5 For you answer to question 4 clearly state: the formula that gives an exact count of the primitive operations for the method, and the Big Oh for the method public static int[] removeEntries(int[] entries) { Random rand = new Random(); int index: while(entries. length > 0) { index = rand.nextInt(entriess.length); System.out.println("Removing: "+entries[index]); entries[index] = entries (entries.length-1] int[] temp = new int[entries.length-1]; for(in 1.0;i 0) { index = rand.nextInt(entriess.length); System.out.println("Removing: "+entries[index]); entries[index] = entries (entries.length-1] int[] temp = new int[entries.length-1]; for(in 1.0;i