Consider this truth table for the partially specified function F(A,B,C)- A-BCFA,BC) 0 1 0 0-11 1- 00 1- 01 a. Show the K-map for F(A,B,C). b. Think about how you want to choose the values of the two Don't Care computed results, then show an image of the K-map with circles around the optimal groupings of K-map minterms to most simplify an SOP implementation of F(A,B.C). Write out this simplest SOP ,C). expression for F(A,]B On a new image of the K-map, and re-considering the choice of values for the Don't Cares, circle the optimal groupings of maxterms to most simplify a POS implementation of F(A,B,C). Write out this simplest POS expression for F(A,B,C).- c