What's a clever way to find all possible combination of these two sets of items?

Question

Let's say I have two kinds of items

data Item1 = A | B | C
data Item2 = D | E | F

And two sets

set1 = [A,B,C]
set2 = [D,E,F]

I would like to find all unique ways of matching the items from two sets, the answer should be (in informal notation):

AD,BE,CF
AD,BF,CE
AE,BD,CF
AE,BF,CD
AF,BD,CE
AF,BE,CD

In other words, I would like some function that accomplish the following:

combine :: [Item1] -> [Item2] -> [[(Item1,Item2)]]
combine = undefined

Note each combination should be a tuple, and each row in the enumeration scheme above should be a list, for example:

[(A,D),(B,E),(C,F)]

Answer 1

Use this

import Data.List (sort, permutations)
combine as bs = zipWith zip (repeat as) (sort $ permutations bs)