Code debug   import java.util.ArrayList; public class ArrayList { public static ArrayList reverse(ArrayList list) { for (int i = 0; i < list.size(); i++) { System.out.println(list); } public static ArrayList getReverse(ArrayList list){ for (int index = 0; index < list.size() / 2; index++) { int temp = list.get(index); list.set(index, list.get(list.size() - index - 1));//swap list.set(list.size() - index - 1, temp); //swap }return list; } } public static void main(String[] args) { ArrayList list = new ArrayList<>(); list.add(1); list.add(2); list.add(3); System.out.println("Original elements : " + list); System.out.println("Reversed elements : " + getReverse(list)); } }

Please use Java, include comments in the code, and explain what the code is doing. Problem is in the photos.

How can an ArrayList be used?

using arrays or Arraylist in Java language Write the method filterBySize().* * Given an ArrayList of String, return a new list where only * strings of the given length are retained.* * Examples:* filterBySize(["a", "bb", "b", "ccc"], 1) returns ["a", "b"]* filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"]* filterBySize(["a", "bb", "b", "ccc"], 4) returns []* * @param list the list of Strings to process.* @param n the size of words to retain.* @return a new list of words with the indicated size retained.

The text's array-based list implementation stores elements in the lowest possible indices of the array. True or False screen shot shows the text's array based list

44 // create a loop that reads in the next int from the scanner to the intList 45 46 47 // call the ReverseArray function 48 49 50 System.out.print("Your output is: "); 51 // print the output from ReverseArray 52 ww 53 54 55 }

Analyse the following code:  public class Test {   public static void main(String[] args) {     int[] oldList = {1, 2, 3, 4, 5};     reverse(oldList);     for (int i = 0; i < oldList.length; i++)       System.out.print(oldList[i] + " ");   }     public static void reverse(int[] list) {     int[] newList = new int[list.length];       for (int i = 0; i < list.length; i++)       newList[i] = list[list.length - 1 - i];       list = newList;   } }   A.  The program displays 1 2 3 4 5 and then raises an ArrayIndexOutOfBoundsException. B.  The program displays 5 4 3 2 1. C.  The program displays 1 2 3 4 5. D.  The program displays 5 4 3 2 1 and then raises an ArrayIndexOutOfBoundsException.

Please answer the problem in the screenshot. Please use the methods below as a base. The language is in Java. import java.util.*;   class HeapMax { // we go with arraylist instead of array for size flexibility private ArrayList<Integer> data;   // DO NOT MODIFY THIS METHOD public HeapMax() { data = new ArrayList<Integer>(0); }   // insert a new element and restore max heap property public void insert(int element) { }   // return max public int getMax() { // remove this line return 0; }   // remove max and restore max heap property public int removeMax() { // remove this line return 0; }   // heap builder public void build(int[] arr) { }   // print out heap as instructed in the handout public void display() { }   // you are welcome to add any supporting methods }

import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public class LinearSearchSet {     // Define a method named linearSearch that takes in a Set and an integer target     // as parameters     public static boolean linearSearch(Set<Integer> set, int target) {         // Iterate over all elements in the Set         for () {             // Check if the current value is equal to the target             if () {                 // If so, return true             }         }         // If the target was not found, return false     }     // Define the main method     public static void main(String[] args) {         // Create a HashSet of integers and populate integer values         Set<Integer> numbers = new HashSet<>();         // Define the target to search for         numbers.add(3);         numbers.add(6);         numbers.add(2);         numbers.add(9);         numbers.add(11);         // Call the linearSearch method with the set…

The following code prints out all permutations of the string generate. Insert the missing statement. public class PermutationGeneratorTester {   public static void main(String[] args)    {        PermutationGenerator generator = new PermutationGenerator("generate");        ArrayList<String> permutations = generator.getPermutations();        for (String s : permutations)        {            ____________________                   }     } }