a. Consider the formulae 01 (r = p) and 02 (p = (qV -r)). Transform the formula 79 (01 102) into DNF. Simplify the result as much as possible. b. Consider the following canonical DNF of a Boolean function f(v, w, x, y) : v w xy + vwx' y' + vw' xy + V' w' xy' + V' w' x' y + v' wxy' + v' wx' y' + V' wx' y What is the minimal number of clauses required in any DNF representation off ? Justify your answer visually by drawing a Karnaugh map