please solve all of them by using data structure

B. Maxsort Add to your class ArrayUtility two static methods implementing the algorithm Maxsort, that takes an unsorted array of integer numbers as input and sorts it in descending order, by repeatedly doing the following: o First, it searches in the whole array for the greatest element; o It then puts this element to the beginning of the array; Then, it searches the whole array excluding the first element for the greatest value and puts it to the second position. Implement the algorithm according to two different strategies: By using the method shiftRight(int[] A, int i, inti): if the maximum element is found in position j and needs to be put into position i, then shift A to the right, starting from position i, while remembering the element in position j that will be overridden; . copy the remembered element to position i. o By using the method swap(int[] A, int i, int j): if the maximum element is found in position i and needs to be put into position j, then use swap to exchange the element in position i with the element in position j