Given the array list of primes below, write a loop to print its elements in reverse order, starting with the last element. Place a space after every element. PrimesDemo.java 1 import java.util.ArrayList; 2 3 public class PrimesDemo 4 { public static void main(String[] args) { ArrayList primes = new ArrayList<>(); primes.add(2); primes.add(3); primes.add(5); primes.add(7); primes.add(11); 6 7 8 9 10 11 12 13 14 for (. .) 15 System.out.print(. . .); } System.out.println(); } 16 17 18 19

Make the code below give out an output the turns the arraylist from highest number to lowest number for both arraylists  use java

Integers numberOfParts, required Groups, and invalid Groups are read from input. If numberOfParts is 21 or more, then add 3 to requiredGroups. Otherwise, add 6 to invalidGroups. ► Click here for examples 3 public class GroupSurvey { 4 public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int numberOfParts; int requiredGroups; I int invalidGroups; 345679 8 9 10 11 12 13 14 15 16 17 18 19 20 } numberOfParts = scnr.nextInt (); requiredGroups = scnr.nextInt (); invalidGroups = scnr.nextInt (); /* Your code goes here */ if(numberOfParts>21){ requiredGroups= System.out.println(requiredGroups); System.out.println(invalidGroups);

java In this assignment you will swap a position in an array list with another. swap() gets 3 arguments, an Arraylist, a position, and another position to swap with. Example   swap(["one","two","three"],0,2)   returns:["three","two","one"]   public static ArrayList<String> swap(ArrayList<String> list,int pos1,int pos2)    public static void main(String[] args) {    Scanner in = new Scanner(System.in);    int size = in.nextInt();    int pos1 = in.nextInt();    int pos2 = in.nextInt();    ArrayList<String> list = new ArrayList<>();    for(int i=0; i < size; i++) {      list.add(in.next());    }     System.out.println(swap(list, pos1, pos2));   }  }