Question 1 c only.

Question 1 (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 you selected F(w,x,y,z)m(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 urcourses. You do not have to draw the circuit. (b) Simplify the above Boolean function using product of sums, with Maxterms, instead of sum of products with minterms. simplification. Is this equivalent to what you found in part (a)? Should it be? Why or why not