To which complexity class does the following algorithm belong? consider n to be the length or size of the array or collection passed tothe method. explain your reasoning. public static int[] mystery1(int[] list) {int[] result = new int[2 * list. length]; for (int i = 0; i < list. length; i++) {result[2 * i] = list[i] / 2 + list[i] % 2; result[2 * i + 1] = list[i] / 2; }return result; }