Solution:
For ease of notation, we let 0=∅,1={S},2={T}. Then both S and T are proper subsets of {0,1,2}. We consider the following cases:
Case 1. If S=∅, then S is a proper subset of any set except the empty set, so we must have T=∅.
Case 2. If S={0}, then T cannot be empty, nor can it contain either 1 or 2, so we must have T={0}. This also implies that if S contains another element, then there would be no choice of T because {0} would be a proper subset.
Case 3. If S={1}, then T cannot contain 0, and cannot contain both 1 and 2 (or it becomes a proper superset of S), so it can only be {1} or {2}, and both work. The similar apply when S={2}.
Case 4. If S={1,2}, then since T cannot contain 0, it must contain both 1 and 2 (or it becomes a proper subset of S), so T={1,2}.
Hence, all the possibilities are
(S,T)=(∅,∅),({0},{0}),({1},{1}),({1},{2}),({2},{1}),({2},{2}),({1,2},{1,2})
for 7 possible pairs in total.