Implement the following algorithms in Java:  3-WAY-QUICKSORT (slide 25). Explain in the report how your implementation operates. slide 25 : In 3-WAY-QUICKSORT, an array A[p..r] is divided in 3 parts −A[p..i] elements less than pivot −A[i+1..j-1] elements equal to pivot −A[j..r] elements greater than pivot. −Based on Dutch National Flag algorithm −Good when input has many duplicates

public static void reverse(ArrayList<Integer> alist){}public static ArrayList<Integer> reverseList(ArrayList<Integer> alist){}   How to use these two headers method and a main method to create the output of  [1,2,3] [3,2,1]

Write and test a Java method clshift() that performs a circular left shift on an array of nintegers.

Please help with the following in JAVA: Question 1 Could you minimize the total number of operations done for the previous problem? Previous Question > Given an integer list nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array. Code public static void main(String[] args) {ArrayList<Integer> mylist = new ArrayList<Integer>();Scanner sc = new Scanner(System.in);System.out.println("Enter the list with last a add : ");while (sc.hasNextInt()) {//TAKING INPUT UNTILL THE USER ENTERS ANY CHARACTER OTHER THAN INTint i = sc.nextInt();mylist.add(i);}int count=0;for(int i=0;i<mylist.size();i++){if(mylist.get(i)==0){count++; //COUNTING NUMBER OF ZEROES}}while(count!=0){for(int i=0;i<mylist.size()-1;i++){if(mylist.get(i)==0){Collections.swap(mylist, i, i+1);}}count--;}for(int i=0;i<mylist.size();i++){System.out.print(mylist.get(i)+ " "); //PRINTING THE…

I want solution with steps