Let S denote the set of all five sequences on Z. Consider the set T of ten elements of S: (a) Sort the ten elements of T into lexicographic order, smallest to largest. (b) Using the relation “is...

Let S denote the set of all five sequences on Z. Consider the set T of ten elements of S:

(a) Sort the ten elements of T into lexicographic order, smallest to largest.

(b) Using the relation “is dominated by” on S:

Find an element of S which is dominated by all of these ten.

Find two elements in the ten which are not comparable under this relation.

Draw the Hasse diagram of the set T.

Find the least upper bound of the set T in S.