Integer listSize is read from input, then listSize integers are read from input and stored in ArrayList valsToPick. In solvePermutation$(),$ complete the recursive case to perform the following tasks:

Move the element at index i of remainVals to the end of pickedVals.

Recursively call solvePermutation$().$

Move the element from the end of pickedVals back to index i of remainVals.

Click here for example

Note:

ArrayList.remove $($i$)$ removes the element at index i of ArrayList.

ArrayList. add$(i,x)$ adds $x$ into ArrayList at index $i.$

import java.util.Scanner;

import java.util.ArrayList;

public class Permutations $\{$

public static void solvePermutation$($Arraylist$i==2=()+$