Use the program logicaid to solve all 3 of the problems

1. Use the KMap Tutorial of LogicAid to find a minimal sum of products and a minimal product of sums for each one of the following Boolean functions(fellow the same steps of Lab#1): . d(1,9, 12, 15) fia,b,c,d)=M(0,2,4,6,8) b. a, g(a,b,c,d)= m(0,3,5,7,8,9,10, 12,13) + d(1,6,11,14). h(a,b,c)- m(0,2,6,7) +Ed(1,3). c, 2. Use the LogicAid to drive a minimal sum of products of the seven- segment display. Submit a hardcopy of the truth table and the equations. 3. Use the LogicAid to drive a minimal product of sums of 2-bit multiplier of two unsigned integers. Submit a hardcopy of the truth table and the equations