The image below should be a K-map; if it is not visible, use…
The image below should be a K-map; if it is not visible, use the equivalent m-notation f(A, B, C, D) = Σ m(2, 3, 7, 8, 10, 12) to draw the K-map. In the K-map above, if you group optimally (with only three groups of two 1s), your resulting Sum of Product (SoP) has the minimum number of gates. The resulting logic design should have due to your grouping. This can be resolved optimally by using consensus term grouping.