Question: How can the Cartesian Product of sets be implemented recursively in Maple?

How can the Cartesian Product of sets be implemented recursively in Maple?
Let k be a positive integer and Si , i=1,...k be nonempty finite sets.
How can Mk:=S1 x S2 x ...x Sk be constructed with Maple by recursion?

Please Wait...