CHALLENGE

ACTIVITY

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

$522562\mathrm{.}3578194$ qx$3$zay$7$

Jump to level $1$

Integer listSize is read from input, then listSize strings are read from input and stored in ArrayList visitorsToPick. The recursive method createQueues $($ explores all unique orderings of two names picked from visitorsToPick. In createQueues $0,$ write the base case to output the following items if the size of ArrayList pickedVisitors is $2$ :

$"1$st:$"$

first element in pickedVisitors

$",2$nd: $"$

second element in pickedVisitors

End with a newline.

Click here for example

import java.util.Scanner;

import java.util. Arraylist;

public class Names $\{$

public static void createQueues$($ArrayList