##### Gate2003_45

The literal count of a Boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of (xy + xz’) is 4. What are the minimum possible literal counts of the product-of-sum and sum-ofproduct representations respectively of the function given by the following Karnaugh map? Here, X denotes “don’t care”

(A) (11, 9)        (B) (9, 13)         (C) (9, 10)       (D) (11, 11)