What is the Big O of the following algorithm

To which complexity class does the following algorithm belong? Consider N to be the length or size of the collection passed to the method. public static char mystery9 (ArrayList list) f return list.get(0).charAt(); O O(constant) O O(N) O O(N logN) To which complexity class does the following algorithm belong? Consider N to be the length or size of the collection passed to the method. public static int mystery10 (ArrayList list) { for (int i-0; i list) ( return 1ist.indexOf ("never found"); O O(constant) O O(N) O O(N 2) O O(logN) O O(N logN) To which complexity class does the following algorithm belong? Consider N to be the length or size of the array passed to the method public static int[] mystery3(int[] list) for (int int ] = list . length-1-1; int temp list [i]; list[i] - list[j]; list[j]- temp; 1-1; i