Write a program to count the minimum number of front moves to sort an array.Note:Create an interface Move and declare a method, the class should implement the interface.Input format :The first line of input consists of the number of elements in the array.The second line of input consists of the array elements, separated by space.Output format :The output displays the minimum number of front moves to sort the given array.Code constraints :N- integer type(Natural numbers)Sample test cases :Input 1 :52 3 1 4 5Output 1 :1Input 2 :75 6 3 2 4 1 7Output 2 :4

You are given an integer array nums.In one move, you can choose one element of nums and change it to any value.Return the minimum difference between the largest and smallest value of nums after performing at most three moves.

Write a program to implement the Selection Sort algorithm to sort an array of integers in ascending order.Input:91 3 5 7 9 2 4 6 8Output:1 2 3 4 5 6 7 8 9Explanation:Initially, the minimum element in the array is 1. It is swapped with the first element, resulting in the array [1, 3, 8, 2, 5, 4]. Next, the minimum element in the remaining unsorted part is 2. It is swapped with the second element, resulting in [1, 2, 8, 3, 5, 4]. This process continues, and the final sorted array is [1, 2, 3, 4, 5, 8].

Write a program that takes an array of integers as input and prints all its subarrays, ensuring that they are sorted based on the forward direction and the count of elements.Constraints:The length of the array is at least 1 and at most 100.Each element of the array is an integer between -1000 and 1000.Input:The input consists of two lines. The first line contains an integer, n, which is the length of the array. The second line contains n space-separated integers, representing the elements of the array.Output:The program should print all the subarrays of the given array in increasing order, one subarray per line.

Find below the shuffled code to find the minimum number in the array. Arrange it in correct order.Scanner sc=new Scanner(System.in);System.out.println("Enter the elements of the array");for(int i=0;i<n;i++)  {minimum=arr[i];}}for(int i=0;i<n;i++){      if(arr[i]<minimum) {System.out.println("Enter the number of elements in the array");int n = sc.nextInt();arr[i]=sc.nextInt();}int arr[]=new int[n];import java.util.Scanner;System.out.println("Minimum element is "+minimum);}}public class Test {public static void main(String[] args) {int minimum=arr[0];

Write a class to sort the given set of integers in descending order. Include a try block tolocate the array index out of bounds exception and catch it.