Question 2: (a) Simplify the Boolean function F together with the don't care conditions d in sum of products form. Indicate all essential prime implicants, and state which remaining prime implicant(s) you selected. F(w,x,y,z)=Sm(0,1,3,7,8,10,13); d(w,x,y,z) = m(2,4,9,15) You may use the template "k-map-4.xls" provided on UR Courses. You do not have to draw the circuit. (b) Simplify the above Boolean function (with don't cares) using product of sums, with Maxterms, instead of sum of products with minterms. (c) Convert the product of sums from part (b) into sum of products form using Boolean simplification. Is this equivalent to what you found in part (a)? Should it be? Why or why not