Write an Oz procedure to generate all two-subset ordered partitions of a list [X1 X2 ... Xn].

For example, [1 2] and [3 4 5] is a two-subset ordered partition of [1 2 3 4 5]. Another

example of a two-subset ordered partition for the same set is [1] and [2 3 4 5].

(Please answer in oz programming language)