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];

01.Find the minimum element and its index in an array 3.5 marks Problem Statement You are given a function, void MinInArray(int arr[], int length); The function accepts an integer array 'arr' of size 'length' as its argument. Implement the function to find the minimum element of the array and print the minimum element and its index to the standard output (STDOUT). The minimum element and its index should be printed in separate lines. Note: Array index starts with 0 Minimum element and its index should be separated by a line in the output Assume there is only 1 minimum element in the array Print exactly what is asked, do not print any additional greeting messages Example: Input: 23 45 82 27 66 12 78 13 71 86 Output: 12 5 Explanation: 12 is the minimum element of array at index 5. The custom input format for the above case: 10 23 45 82 27 66 12 78 13 71 86 (The first line represents the size of the array, the second line represents the elements of the array) Sample input 1 9 11 144 6 7 112 95 Sample Output 1 0 The custom input format for the above case: 8 1 9 11 144 6 7 112 95 (The first line represents the size of the array, the second line represents the elements of the array) Instructions : This is a template based question, DO NOT write the "main" function. Your code is judged by an automated system, do not write any additional welcome/greeting messages. "Save and Test" only checks for basic test cases, more rigorous cases will be used to judge your code while scoring. Additional score will be given for writing optimized code both in terms of memory and execution time. give me the code

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].

You are given a sorted array of integers. Write a program that implements a binary search algorithm to find the element with the minimum difference from the given target.Note: This question was asked in CTS coding test.Input format :The first line input consists of an integer N, representing the number of array elements.The second line consists of N space-separated integers, representing the sorted array elements.The third line consists of an integer representing the target element.Output format :The output prints an integer representing the element with the minimum difference from the given target.

import java.util.Scanner;public class Test { public static void main(String[] args) { Scanner sc=new Scanner(System.in); System.out.println("Enter the number of elements in the array"); int n = sc.nextInt(); //Declare the array int arr[ ]=new int[n]; //Get the elements from user System.out.println("Enter the elements of the array"); for(int i=0;i<n;i++){ arr[i]=sc.nextInt(); } //Code to find the sum of odd elements in the array int sum=findSumOddElements();   // invoke the method System.out.println("The sum is "+);        } public int findSumOddElements() { int sum=0; for(int i=0;i<;i++) { if(()!=0) { sum=sum+arr[i]; } }   ;  //return statement }}

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