For an array with 15 elements, how many iterations are required to sort the elements using selection sort algorithm? D 14 (b) 15 (c) 12 (0.5) 04 (d) 16 Data structures and algorithms.

python # Initialize a 6x6 matrix with all elements as 0 matrix = [[0 for _ in range(6)] for _ in range(6)] # Fill in the matrix for i in range(6): # Iterate over rows for j in range(6): # Iterate over columns if i > j: matrix[i][j] = 3*j - 4*i else: matrix[i][j] = 0 # Print the matrix for row in matrix: print(row)

desingn and implement parallel sort algorithm using MPI An array of given size is to be sorted. The size, the type of array and type of sort  technique should be considered optional

make an algorithm using the procedure to display the contents of a defined array, Array B[10] = (9, 11, 23, 7, 8, 20, 77, 22, 10, 6)