Problem 1E: ch of these relations on {0,1,2,3) are partial orderings? Determine the properties of a partial... Problem 2E: ch of these relations on {0,1,2,3} are partial orderings? Determine the properties of a partial... Problem 3E Problem 4E Problem 5E: ch of these are posets? a)(Z,=) b)(Z,) c)(Z,) d)(Z,l) Problem 6E: Which of these are posets?a) (R, =)b) (R,<) c) (R,)d) (R,) Problem 7E: Determine whether the relations represented by these zero-one matrices are partial orders.... Problem 8E: Determine whether the relations represented by these zero-one matrices are partial... Problem 9E: Exercises9-11determine whether the relation with the directed graph shown is a partial order. Problem 10E: Exercises9-11determine whether the relation with the directed graph shown is a partial order. Problem 11E: Exercises 9-11 determine whether the relation with the directed graph shown is a partial order. Problem 12E Problem 13E: d the duals of these posets. a)({0,1,2},) b)(Z,) c)(P(Z),) d)(Z+,) Problem 14E: ch of these pairs of elements are comparable in the poset(Z+,)? a) 5,15 b) 6,9 c) 8,i6 d) 7,7 Problem 15E Problem 16E: Let S = {1,2,3,4). With respect to the lexicographic order based on the usual less than elation, a)... Problem 17E: d the lexicographic ordering of thesen-tuples: a) (1, 1, 2), (1, 2, 1) b) (o, 1, 2, 3), (o, 1, 3, 2)... Problem 18E: d the lexicographic ordering of these strings of lowercase English letters: a)quack, quick,... Problem 19E: d the lexicographic ordering of the bit strings 0,01,11,001,010,011,0001, and 0101 based on the... Problem 20E: w the Hasse diagram for the greater than or equal to relation on {0,1,2,3,4,5}. Problem 21E: w the Hasse Diagram for the less than or equal to relation on {0,2,5,10,11,15]. Problem 22E Problem 23E Problem 24E: w the Hasse diagram for inclusion on the setP(S),whereS=a,b,c,d. Problem 25E: Exercises 25-27 list all ordered pairs in the partial ordering with the accompanying Hasse diagram. Problem 26E: Exercises 25-27 list all ordered pairs in the partial ordering with the accompanying Hasse diagram. Problem 27E: Exercises 25-27 list all ordered pairs in the partial ordering with the accompanying Hasse diagram. Problem 28E: What is the covering relation of the partial ordering {(a, b)|a divides b} on {1,2,3,4,6,12}? Problem 29E: What is the covering relation of the partial ordering{(A,B)AB}on the power set of S, whereS={a,b,c}? Problem 30E: What is the covering relation of the partial ordering for the poset of security classes defined... Problem 31E: w that a finite poset can be reconstructed from its covering relation.[Hint:Show that the poset is... Problem 32E: wer these questions for the partial order represented by this Hasse diagram. Find the maximal... Problem 33E: wer these questions for the poset ({3, 5,9, 15, 24,45}, |) a) Find the maximal elements. b) Find the... Problem 34E: wer these questions for the poset ({2, 4, 6, 9, 12, 18, 27, 36, 48, 60, 72}, |). a) Find the maximal... Problem 35E: wer these questions for the poset ({{1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {3, 4}, {1, 3, 4}, {2, 3,... Problem 36E Problem 37E: Show that lexicographic order is a partial ordering on the Cartesian product of two posets. Problem 38E: w that lexicographic order is a partial ordering on the set of strings from a poset. Problem 39E: Suppose that (S,1) and (T,2) are posets. Show that(ST,) is a poset where (s, t)(u, v) if and only if... Problem 40E: a) Show that there is exactly one greatest element of a poset, if such an element exists. b) Show... Problem 41E: a) Show that there is exactly one maximal element in a poset with a greatest element. b) Show that... Problem 42E: a) Show that the least upper bound of a set in a poset is unique if it exists. b)Show that the... Problem 43E: Determine whether the posets with these Hasse diagrams are lattices. Problem 44E Problem 45E: Show that every nonempty finite subset of a lattice has a least upper bound and a greatest lower... Problem 46E: Show that if the poset (S,R) is a lattice then the dual poset(S,R1)is also a lattice. Problem 47E: a company, the lattice model of information flow is used to control sensitive information with... Problem 48E Problem 49E: Show that the set of all partitions of a set S with the relationP1P2if the partitionP1is a... Problem 50E: Show that every totally ordered set is a lattice. Problem 51E: Show that every finite lattice has a least element and a greatest element. Problem 52E: Give an example of an infinite lattice with a) neither a least nor a greatest element. b) a least... Problem 53E Problem 54E: ermine whether each of these posets is well-ordered. a)(S,), whereS= {10, 11, 12,…}b)(Q[0,1],)(the... Problem 55E Problem 56E: Show that dense poset with at least two elements that are comparable is not well-founded. Problem 57E: Show that the poset of rational numbers with the usual less than or equal to relation,(Q,), is a... Problem 58E: Show that the set of strings of lowercase English letters with lexicographic order is neither... Problem 59E Problem 60E: w that a finite nonempty poset has a maximal element. Problem 61E: Find a compatible total order for the poset with the Hasse diagram shown in Exercise 32. Problem 62E: d a compatible total order for the divisibility relation on the set {1, 2, 3, 6, 8, 12, 24, 36). Problem 63E: Find all compatible total orderings for the poset ({1, 2, 4, 5, 12, 20}, I) fromExample26. Problem 64E: Find all compatible total orderings for the poset with the Hasse diagram in Exercise 27. Problem 65E: Find all possible orders for completing the tasks in the development project in Example 27. Problem 66E: Schedule the tasks needed to build a house, by specifying their order, if the Hasse diagram... Problem 67E format_list_bulleted