java This method gets an Arraylist of Integers and a number(Integer). It returns an Arraylist. It removes any instance of the given number from the Arraylist. Example:   romoveInst([1,1,2,3,1,4],1)   returns: [2,3,4]   romoveInst([3,4,3,3],4)   returns: [3,3,3]   public static ArrayList removeInst(ArrayList r,Integer n)    public static void main(String[] args) {     Scanner in = new Scanner(System.in);     int size = in.nextInt();     int n = in.nextInt();     ArrayList list = new ArrayList<>();     for(int i=0; i < size; i++) {       list.add(in.nextInt());     }     System.out.println(removeInst(list, n));   }  }

in java

In Java

JAVA complete a method that swaps the first and second half of an array of integers. For example, if the array contains the values 1 4 9 16 25 36then after calling the method, it should contain the values16 25 36 1 4 9If the array contains an odd number of elements, leave the middle element in place. For example, 1 4 9 16 25 36 45becomes25 36 45 16 1 4 9

5. How to find all the leaders in an integer array in java? An element is leader if it is greater than all the elements to its right side. And the rightmost element is always a leader. For example int the array {16, 17, 4, 3, 5, 2}, leaders are 17, 5 and 2..

Java Complete the method with explaining, thank you!

JAVA programming language i need to create an "addFront" method in the bottom of the code that adds an element at the front. [-1, -3, -5]  A.add(-9) ===> [-9, -1, -3, -5]. Its all the way in the bottom, please help me. public class ourArray  { //define an array of integers private int[] Ar; //Ar is a reference  //declare  private int capacity = 100; private int size = 0; private int increment = 10;   //default constructor   public ourArray() { Ar = new int[100]; capacity = 100; size = 0; increment = 10;   } //Constructor that accepts the capacity (C). It creates an array of C integersm, sets capacity to C //  Increment to 10 public ourArray(int C) { Ar = new int [C]; size = 0; capacity = C; increment = 10; } //Constructor that accepts two integers (c, i) c for capacity and i for increment public ourArray (int C, int I) { Ar = new int[C]; size = 0; capacity = C; increment = I;   }   //setter for Increment public void setincrement(int I) { increment = I; } //getter for size, capacity…

public int[] selectionSort(int[] array) {for (int i = 0; i < array.length - 1; i++) {int min = array[i];int minIndex = i;for (int j = i + 1; j < array.length; j++) {if (min > array[j]) {min = array[j];minIndex = j;}}if (minIndex == i) {array[minIndex] = array[i];array[i] = min;}}return array;}

JAVA Chapter 9 Multidimensional Arrays and the ArrayList Class Write a value returning method that returns the sum of the elements in the last column of each row in a two-dimensional array of ints. Include code to test your method.

in java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.