Write a function in SWI Prolog called "permutations", that takes a list as input and generates a list containing all possible permutations of the list elements. Here is a sample application: Make sure the output matches that of the example and I will upvote clear answer where you show the function working. Thanks

This input

?- permutations([1,2,3],X).

Generates this output

X=[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] Yes ?-

Please show a test run of the function to show it works properly in the SWI prolog program window.