please help with it

For the given algorithms, specify what is the time complexity of the algorithms using big-O notation. You do not need to write your computations. [4 points] A) public void squareIt(double array, int index) { try { array [ index] = Math. pow(array[index], 2); } catch (ArrayIndexOutOfBoundsException e) { System. out . printIn("Invalid index!"); public static void insertionSort(List array) { int length = array . size(); for (int i = 0; i = 0 && array. get(j)> target) { array . set(j + 1, array.get(j)); j = j - 1; } array . set(j + 1, target); int n = 10; Stack integerStack = new Stack(); for (int i = 0; i