6) (6 points) A Salt Lake City based company (called Intractable Logistics) employs 6 (six) sales persons, referred to as S1, S2, ...,S6. The company has business interests in London (L), Paris (P), New York (N), Tokyo (T), Moab (M) and Zurich (Z); and it wants these cities to be visited by its sales persons. Unfortunately: Sales person S can only visit cities L, N, and M. S2 can only visit T and M. Sz can only visit P, N, and Z. S4 can only visit N, T, and Z. S5 can only visit L, T, and M. S6 can only visit L, P, and Z. a) Assuming that the cost (salary or commission) of each sales person is the same, identify a minimum number of sales persons required to cover all the cities. b) Now assume that Si costs $15K, S2 costs $30K, S3, S4, S5 cost $40K each, and S6 costs $30K. Identify a set of sales persons to cover all cities such that the total cost is minimized. You have to formulate this problem as a Quine-McCluskey style table covering, and solve the problem algorithmically i.e. by using essentials, row/column dominance, branching, etc. No points for just stating the answer. 6) (6 points) A Salt Lake City based company (called Intractable Logistics) employs 6 (six) sales persons, referred to as S1, S2, ...,S6. The company has business interests in London (L), Paris (P), New York (N), Tokyo (T), Moab (M) and Zurich (Z); and it wants these cities to be visited by its sales persons. Unfortunately: Sales person S can only visit cities L, N, and M. S2 can only visit T and M. Sz can only visit P, N, and Z. S4 can only visit N, T, and Z. S5 can only visit L, T, and M. S6 can only visit L, P, and Z. a) Assuming that the cost (salary or commission) of each sales person is the same, identify a minimum number of sales persons required to cover all the cities. b) Now assume that Si costs $15K, S2 costs $30K, S3, S4, S5 cost $40K each, and S6 costs $30K. Identify a set of sales persons to cover all cities such that the total cost is minimized. You have to formulate this problem as a Quine-McCluskey style table covering, and solve the problem algorithmically i.e. by using essentials, row/column dominance, branching, etc. No points for just stating the