Consider two Functions F = E(1,2,3,5,7,9) and G = E(0,5,7,8,9,11,13,15)
a) Use K-maps to minimize the function F
b) Use K-maps to minimize the function G
c) How many total terms and literals are present in the two equations?
Now use K-maps tp minimize F and G when both are implemented in the same circuit so that their combine implementations use the fewest terms and literals.
a) What is the optimized Boolean Function F
b) What is the optimized Boolean function G
c) How many total terms and literals and present in the two equations?