2 42 271 The sort algorithm sorts a list by selecting the smallest element in the list, swapping this smallest element to the front of the list, then repeating, starting from the element to its right. O merge O quick insertion O selection 2 43 24 In an algorithm analysis, if the complexity of the algorithm can be described as a quadratic function without the linear term, you say that the algorithm is of complexity O ON O ON ON O O/Nlog N2) O ON U 144 4 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[] mystery (int[] list) { int[] result - new int[2. list.length); for (int i -2; i list) { for (int i - B; i instantiation? O File O String O int O Employee 47 151 The methods defined by Stack and Queue classes can all have O(1) run-time complexity if implemented properly. O True O False