Problem 5 (Branch and Bound and Cyclic Core). Use the concepts of Constraint Matrix, Cyclic core as discussed in class to solve the following problems. 1. Solve the covering problem shown in Table 2 using Branch and Bound algorithm. All rows have unit costs. [Points : 10] 2. For the constraint matrix of Table 3 , say whether the cyclic core is empty / non-empty. Please show your calculation explicitly. A Yes / No answer will yield ' 0 ' point. [Points : 15] Table 3: Prime Implicant Table for Problem 5. Homework 2 Table 2: Prime Implicant Table of Problem 5. Problem 5 (Branch and Bound and Cyclic Core). Use the concepts of Constraint Matrix, Cyclic core as discussed in class to solve the following problems. 1. Solve the covering problem shown in Table 2 using Branch and Bound algorithm. All rows have unit costs. [Points : 10] 2. For the constraint matrix of Table 3 , say whether the cyclic core is empty / non-empty. Please show your calculation explicitly. A Yes / No answer will yield ' 0 ' point. [Points : 15] Table 3: Prime Implicant Table for Problem 5. Homework 2 Table 2: Prime Implicant Table of Problem 5