4.1 Given this prime implicant chart P1 0,2 0, 4 4,6 2, 6 3, 7 6, 7 a'c b'c bc' bc ab a) In the first column, label each row with the terms Px where x is a number starting from 1 (e.g. P1, P2, P3, ....). We've labelled P1 for you b) Which minterms are covered by the essential prime implicants. Cross them out in the top row of the table c) Consider the remaining minterms that are not covered by essential prime implicants Write a POS equation that must evaluate to true in terms of Px for any valid POS solution to the original problem. (for example, if m2 was covered by P3 and P4, then you would include (P3 + P4) in any solution, - similarly for all the minterms not in part b). Do this for each minterm that isn't covered by an essential prime d) Clearly, a bit of algebra is required to recast c) into SOP form. Rather than doing the algebra, what is the maximum number of literals in any implicant of the SOP form? e) What is the minimum number of literals possible in any implicant of the SOP form expansion of c). Write one of these implicants which represents the SOP of some subset of the Px rows 4.1 Given this prime implicant chart P1 0,2 0, 4 4,6 2, 6 3, 7 6, 7 a'c b'c bc' bc ab a) In the first column, label each row with the terms Px where x is a number starting from 1 (e.g. P1, P2, P3, ....). We've labelled P1 for you b) Which minterms are covered by the essential prime implicants. Cross them out in the top row of the table c) Consider the remaining minterms that are not covered by essential prime implicants Write a POS equation that must evaluate to true in terms of Px for any valid POS solution to the original problem. (for example, if m2 was covered by P3 and P4, then you would include (P3 + P4) in any solution, - similarly for all the minterms not in part b). Do this for each minterm that isn't covered by an essential prime d) Clearly, a bit of algebra is required to recast c) into SOP form. Rather than doing the algebra, what is the maximum number of literals in any implicant of the SOP form? e) What is the minimum number of literals possible in any implicant of the SOP form expansion of c). Write one of these implicants which represents the SOP of some subset of the Px rows