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. Please show your program executing in SWI prolog like the following example. Here is a sample application:

Input:

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

Result:

X=[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

Yes

?-