2.A.) (10 POINTS) Write the corresponding product-of-sums (POS) canonical form Boolean equation for this table. Please show your work. 2.B.) (15 POINTS) Simplify the POS canonical form of the table by using Karnaugh-map. Please show your work. Though usual way of simplifying Boolean equations is to use SOP canonical form and place minterms onto the K-map, then circle as many implicants (of integer powers of 2) as possible to simplify the equation. A similar approach can be used to simplify a POS canonical form by using Karnaugh-map (K-map) The process for simplifying a POS canonical form using K-map is the complement of the process of simplifying a SOP canonical form using K-map: For a POS canonical form, a 0 is placed in the cell corresponding to each maxterm of the POS expression. The next step is similar to SOP simplification on K-map, with the distinction that we write maxterms, instead of minterm:s As an example, given a function in POS canonical form as F II(3, 5, 7, 8, 10, 11, 12, 13), the two possible simplifications of F using K-map is as follows