3. Simplify the same Boolean function f(a,b,c,d)=(a+b)c+d(b+ac) to be a sum of minterms. Implement the sum of minterms with a network of gates. 4. Put the two implementations above of the same Boolean function f(a,b,c,d)=(a+b)c+d(b+ac) to another circuit (you can do it by using copy-and-paste). Remove all the binary switches. Use a single hexadecimal keyboard to provide input to the a, b, c and d of both implementations. Be sure to use two different names for the two outputs. Walk through all the 16 input combinations to verify that the two implementations provide the same output values