Please use the following truth table A B C DY 0 0 100 0 0 1 1 1 0 1000 0 101 0 0 110 1 1 0 001 1 0 101 1 1000 1 101 0 1 1 1 0 0 1 1 11 0 2.A.) Write the corresponding product-of-sums (POS) canonical form Boolean equation for this table. Please show your work. 2.B.) Simplify the POS canonical form of the table by using Karnaugh-map. Please show youf 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 minterms 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