Study the below algorithm to delete and re-organize elements into an array. algorithm Deletion (arrayA, index) Pre: index is the position of element to be deleted. Post: Display a new re-organized array index_copy=index while index_copy is less than array_size arrayA[index_copy] is equal arrayA[index_copy + 1] index_copy is equal index_copy + 1 end while array_size equals array_size - 1 display a new re-organized array end Deletion a) Explain how the above algorithm works. b) Convert the above algorithm to a Java method. c) Considering how elements can be deleted in an array, and re-organized the elements, give a detailed explaination how you can efficiently insert new values to an array on any given index.

In exArray, sort each column along the direction of the rows in ascending order. 1 #Load necessary package 2 import numpy as np 3 4 # Create array 5 exArray = np.array([['n', 'v', 'g', '1', 'z'], ['b', 'y', 'c', 'r', 'f']]) 6 7 # Sort array 8 exArray_sorted = np.sort(exArray) 9 10 # Print the array 11 print(exArray) Check 1 Next level X 1: Compare output exArray. sort () takes an axis argument that determines along which axis the array should be sorted. a column along the direction of the rows. Not all tests passed. Output differs. See highlights below. Your output Expected output [['n U 1 'V' y ['b' 2 [['g' ['b' U U 1 '1' c' g 50 1 'C n 'f V V 1 1 14 V r 1 1 1 z'] 'f']] 'z'] 'y'll 3 T 4

2. Please sort the input array [3 -10 9 21 -7 8 14 1] using QUICKSORT algorithm to output an increasing order array. The last element is used as Pivot (please show detailed steps for full credits) 3. Please use counting sort to sort the following array: [1 60255325 2|