2. Consider the Karnaugh map of a Boolean function g(w, x, y, z) shown at right. (a) Use the Karnaugh map to find the DNF for g(w, x, y, z). (b) Use the Karnaugh map algorithm to find the minimal expres- sion for g(w, x, y, z). (Hint: see Q8 on Practice Class 4A for a very similar exercise.) x y zh(x, y, z) 000 01 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 0 0 1 2 IN yz xy 3. Use a don't care Karnaugh map to find a minimal representation for a Boolean expression h(x, y, z) agreeing with the incomplete I/O table below: WI WI WI wx yz y 1 1 11 yz 1 1 x T xu 1