1. A function, F, is implemented using the 8:1 multiplexer shown below. Finish filling in the Karnaugh map shown below.
2. It turns out that in implementing F using the multiplexer of problem 1, some assignments were made to don't care conditions. In reality, we do not care what the function output is whenever C is 0 and D is 1. Minimize the function taking advantage of this don't care information by first filling in a new K-map with the don't cares present. Finally, implement the resulting minimized expression using the PAL shown below by placing an "X" where you want a connection to be made.
Note how the don't cares were used in part 1. The assignment of 1, 0, 0, 1 to the four Xs made the inputs to the multiplexer simpler (that is, by allowing them to be tied to 0 or 1 rather than D or D'). In this case, the don't care conditions do not help us in deriving a simpler logic expression. However, note that we would have needed one more product term if we had to implement the same function as in part 1 (with the same don't care assignment that produced a good result for the multiplexer implementation).