CHALLENGE

ACTIVITY

$2\mathrm{.}7\mathrm{.}2$: Recursive exploration of all possibilities.

$522562\mathrm{.}3578194\mathrm{.}932qy7$

Jump to level $1$

Integer listSize is read from input, then listSize integers are read from input and stored in ArrayList valsToPick. In solvePermutation $0,$ 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$(0.$

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(0)+$