(10 pts) 5. Simplify the following Boolean function F, together with the don't care conditions d, and then express all possible simplified expressions in sum-of-products form. F(X, Y, Z) = (0., 4,5,6), (X,Y,Z) = (1, 2, 7) (10 pts) 6. With the use of maps, find the simplest sum-of-products form of the function F-f.g, where f = abc' + c'd + a'cd'+b'cd' and g=(a+b+c' + d') (b'+c+d) (a' +c+d')