The complexity of a list’s __getitem__(index) method is O(n) for an array implementation.   Question 4 options:   False   True

def create_identity_matrix(n):"""Create a nxn sized identity matrix. The return type should be a list or numpy ndarrayFor more info: https://en.wikipedia.org/wiki/Identity_matrixFor this exercise you can use nested loops to construct your 2d array or find an applicable function in the numpy library.:param n::return: nxn ndarray where the diagonal elements are 1 and nondiagonal elements are 0"""pass

ARRAY RANDOMIZER Create a program that shuffels all the elements present in an array. To shuffle an array, you need to do at least 500 random swaps of any elements in the array given below. Print the shuffled array in the output. {12, 54, 22, 100, -3, 5, 10, -33, 78, 90, 29, -45, 77, -9, 19, 21} Language: CPP

in java Integer numElements is read from input, representing the number of integers to be read next. Then, the remaining integers are read and stored into array valuesArray. For each element in valuesArray that is divisible by 9, assign the element with the element's current value plus 1. Ex: If the input is: 3 81 99 30 then the output is: Original values: 81 99 30 New values: 82 100 30 Note: (x % 9 == 0) returns true if x is divisible by 9. 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32     for (i=0; i<valuesArray.length; ++i) { valuesArray[i] =scnr.nextInt(); }   System.out.print("Original values: "); for (i=0; i<valuesArray.length; ++i) { System.out.print(valuesArray[i] +" "); } System.out.println();   /* Your code goes here */   System.out.print("New values: "); for (i=0; i<valuesArray.length; ++i) { System.out.print(valuesArray[i] +" "); } System.out.println(); } }