please explain how you do it i do not understand how to do it well

Problem 2: (25 pts.L Karnaugh Map and De Morgan laws YZ 01 10 WX An SOP Boolean expression is defined as 32 2 fim(0, 2, C, D, E, F) AND the inputs are such that x is never 1 when w= 0. 01 6 a- Map the function and find the prime b- Find the simplified SOPexpression and c- Redraw the circuit using only NOR gates. 4 415 5 7 implicants on the K-map c 12 D 13 F 15 E 14 draw the simplified circuit. 10 8 8 9 9 B 11A 10