Optimize the logic implementation of Y by drawing the ovals on top of each K-Map; only draw those ovals that will be included in the optimal implementation. Then write the resulting Boolean expression below the K-Map. All missing entries in the K-Maps are 0s.

AB 00 01 11 10 AB 00 01 11 10 10 1 101x Solution: Y= Solution: Y= AB 00 01 11 10 CAB 00 01 11 10 8 5 = 10 11 Solution: Y= Solution: Y=