Optimize the following Boolean Function F together with don't care condition d: F(W, X, Y, Z) = Sigma m (2, 4, 9, 12, 15), d(W, X, Y, Z) = Sigma m (3, 5, 6, 13) The excess-3 code for a decimal digit is the binary combination corresponding to the decimal digit plus 3. The excess-3 code for decimal digit 5 is the binary combination for 5 + 3 = 8, which is 1000. Each BCD digit is 4 bits, which are labeled as A, B, C, D. Each excess-3 digit is 4 bits, labeled W, X, Y, Z. Determine the results for BCD inputs 0 through 15. Draw Maps for the 4 output functions with don't care conditions. (Mark all the 6 don't care minterms, 10 through 15, with an X)