The image below should be a $\backslash ($ K $\backslash )-$map; if it is not visible, use the equivalent $\backslash ($ m $\backslash )-$notation $\backslash ($ f$($A$,$ B $\backslash ),\backslash ($ C$,$ D$)=\backslash$sum m$(1,2,3,5,10,11)\backslash )$ to draw the K$-$map.

$\backslash (\{\}^\{$f$\}\backslash )$

In the K$-$map above, if you group optimally so that your resulting Sum of Product $($SoP$)$ has the minimum number of gates.

The resulting logic design should have

$[$Select$]$

zero Static $1-$hazards

two Static $0-$hazards

one Static $1-$hazards

zero Static $0-$hazards

three Static $1-$hazards

three Static $0-$hazards

five Static $1-$hazards

one Static $0-$hazards

five Static $0-$hazards

four Static $0-$hazards

four Static $1-$hazards

two Static $1-$hazards