Make a minimal and maximal 2-digit number from digits of two 3-digit numbers Let's solve this user's homework; I think it's an interesting exercise!
Input
Two 3-digit natural numbers.
Outputs
Two 2-digit numbers. In each of the output numbers, one digit is taken from one input number, and the other from the other number. The choice is independent. The first output number should be the minimal possible to create using these constraints, and the second one should be the maximal such number (or vice versa).

Input numbers never have leading zeros; output numbers should also not have leading zeros.
Input and output can be encoded as numbers, strings, lists of digits, etc.


Examples (in format input - output):
123, 912 - 11, 93
888, 906 - 68, 98
100, 100 - 10, 11
222, 222 - 22, 22
123, 222 - 12, 32
798, 132 - 17, 93
Husk, 15 14 13 9 bytes
§,▼▲f←ṁP*

Try it online!
Takes two input arrays, outputs pair (min,max).
-1 byte from Dominic Van Essen.
-1 more byte from Dominic Van Essen (after some more struggling).
-4 bytes taking arrays of digits as input.
Explanation
§,▼▲f←ṁP*
        * cartesian product pairs of the inputs
      ṁP  map each to permuations, and flatten the list
    f←    remove elements where first digit is falsy(&lt;10)
§,        create pair with
  ▼▲      minimum and maximum