Consider this truth table for the partially specified function E(A,B,C) a. Show the K-map for (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 expression for (A,B,C) 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 EA,B,C). Write out this simplest POS expression for (A,B,C) c