To which complexity class does the following algorithms belong? Consider N to be the length or size of the array or collection passed to the method. Explain your reasoning.

OPTIONS:

O(1) - O(N) - O(N^2) - O(logN) - O(N*logN)

1.

2.

3.

4.

5.

6.

// so tricky, this questions has changed a little public static int[] mystery1(int[] list) inti] result- new int[2]; int n 1000000; result[1] n; return result; public static int[] mystery2(int[] list) for (int i-0 iklist.length/2; i++) int j list.length-1-i; int temp-list[i]; list[i] - list[j]; list[j]-temp; return list; public static void mystery6 (ArrayList list) Collections.sort(list); public static void mystery8 (ArrayList list) for (int i-0; i