Let A = {1, 3, 5, 7}; B = {5, 6, 7, 8}; C = {5, 8}; D = {2, 5, 8}; and U = {1, 2, 3, 4, 5, 6, 7, 8}. Determine whether the given statement is true or false. 26) C 9 D A) True B) False Let A = {6, 4, 1, {3, 0, 8}, {9}}. Determine whether the statement is true or false. 27) {3, 0, 8} c A A) True B) False Provide an appropriate response. 28) One of the following is false; indicate by letter which one: A) 4 e {3, 4, 5, 6} B) 5 e {3, 4, 5, 6} C) 4 c {3, 4, 5, 6} D) {4} c {3, 4, 5, 6} 29) Which of the following is NOT a subset of the set {p, o, 7}? A) {p. 0, 7} B) {0. 7} C) 7 D) a Use a Venn Diagram and the given information to determine the number of elements in the indicated region. 30) In a marketing survey involving 1,000 randomly chosen people, it is found that 660 use brand P, 440 use brand Q, and 220 use both brands. How many people in the survey use brand P and not brand Q? Solve the problem. 22) Formulate the following problem as a linear programming problem (DO NOT SOLVE):A veterinarian wants to set up a special diet that will contain at least 500 units of vitamin 81 at least 800 units of vitamin Bz and at least 700 units of vitamin 136. She also wants to limit the diet to at most 300 total grams. There are three feed mixes available, mix P, mix Q, and mix R. A gram of mix P contains 3 units of vitamin B1, 5 units of vitamin 132, and 8 units of Vitamin B6. A gram of mix Q contains 9 units of Vitamin B1, 8 units of vitamin Bz, and 6 units of vitamin B6. A gram of mix R contains 7 units of vitamin Bl, 6 units of vitamin 32, and 9 units of vitamin B6. Mix P costs $0.10 per gram, mix Q costs $0.12 per gram, and mix R costs $0.21 per gram. How many grams of each mix should the veterinarian use to satisfy the requirements of the diet at minimal costs? (Let x1 equal the number of grams of mix P, x2 equal the number of grams of mix Q, and x 3 equal the number of grams of mix R that are used in the diet). A) Minimize C = 0.10x1 0.12x2 0.21x3 B) Minimize C = 0.10x1 + 0.12x2 + 0.21x3 subject to subject to C) Minimize subject to 3x1 + 9x2 + 7x3 s 500 5X1 + 8x2 + 6x3 5 800 8x1 + 6x2 + 9x3 2 700 x1 +x2+x3 5300 x1, x2, x3 2 0 C : 0.10x1 0.12x2 0.21x3 3x1 + 9x2 + 7x3 s 500 5x1 + 8x2 + 6x3 5 800 8x1 + 6x2 + 9x3 2 700 X} +x2+x3 5300 x1, x2, x3 2 0 D) Minimize subject to 3x1 + 9x2 + 7x3 2 500 5x1 + 8X2 + 6x3 2 800 8x1 + 6x2 + 9x3 2 700 x1 +x2 +x3 5300 X1, x2, x3 2 0 C : 0.10x1 0.12x2 + 0.21x3 3x1 + 9x2 + 7x3 5 500 5x1 + 8x2 + 6x3 2 800 8x1 + 6x2 + 9x3 2 700 x1 +x2 +x3 5300 x1, x2, x3 2 0