(c) Using the K-map, simplify the Boolean function given by F(A, B, C) = (A + B+C)(A+B+C)(A+B+C) [5] and the don't care condition expressed as (A + B)( + B + C). (d) Use maxterms (not minterms) and a K-map to convert the Boolean ex- pression, y=C + AB + B into a canonical POS form. [5] (e) Write the simplified Boolean expression F(A, B, C) for the truth table shown below and draw its logic circuit. [3] CF 0 0 0 1 1 1 A B 0 0 0 0 1. 1 1 1 O 0 1 1 0 1 0 1 1 0 0 1 1- 0 0 0 1 1