Convert the following Boolean expressions into their Canonical/Standard forms: i) f(a,b,c,d) = a'b + ac + bcd ii) f(x,y,z) = xyz + x'y'z' OR Design a combinational logic circuit that takes two 3-bit binary numbers as inputs and produces an output of logic '1' when the SUM of the two numbers is EVEN.

Using Karnaugh maps, determine all the prime implicants and prime implicates for each of the following Incomplete Boolean functions. In each case, indicate which is essential. f(w,x,y,z) = ∑m(0,2,5,7,8,10,13,15) + d(1,4,11,14) OR Using Karnaugh maps, determine all the prime implicates for each of the following Boolean functions. f(v,w,x,y,z) = ПM(0,2,4,6,8,12,14,15,16,18,20,22,30,31)

Using Quine-McCluskey method, obtain all prime implicant for the following Boolean function: J = fa,b,c,d= ∑0,1,4,5,9,10,12,14,15+dc2,8,13 OR Using Quine-McCluskey method, obtain all prime implicant for the following Boolean function: K= fa,b,c,d= ПM0,3,4,7,8,10,12,14,+d(2,6)

Design Full adder circuit OR Design Full subtractor circuit