please solve all of them by using data structure

A. Implementation of the basic operations of the class ArrayUtility, which offers basic operations over one-dimensional and two-dimensional arrays. All methods must be implemented as class methods (i.e., static methods). The signature of the methods in the Array Utility class are the following: 1. public static int findMax(int[] A, int i, int j): returns the maximum value occurring in the array A between position i and j. 2. public static int findMaxPos(int[] a, int i, int j): returns the position of the maximum value in the array A between position i and j. 3. public static int findMin(int[] A, int i, int j): returns the minimum value in the array A between position i andj. 4. public static int findMinPos(int[] a, int i, int j): return the position of the minimum value in the array A between position i and j. 5. public static void swap(int[] A, int i, int j): swaps the elements in position i and j in the array A. 6. public static void shiftRight(int[] a, int i, int j): shifts to the right all the elements of the array A starting from position i and until position j (i.e., moves the element in position k to position k + 1 for all is k