Integers are read from input into list vals$\_$to$\_$pick. In solve$\_$permutation$(),$ complete the recursive case to perform the following tasks for each element at index i in remain$\_$vals:

Create a new list that contains all elements of remain$\_$vals except the element at index i$.$

Create a second new list that contains all the elements in picked$\_$vals with the element at index i added at the end of the list.

Recursively call solve$\_$permutation$()$ with the two newly created lists and count as the arguments. Assign count with the value returned by solve$\_$permutation$().$