how would you simplify the expression using k map instead of all that?

5. Assume d3d₂d₁do is a BCD number and derive Boolean expression for segments b,c,e,f,g in a seven segment display in terms of d3d₂d₁do g 4 d Based on your boolean expressions derive the values of b,c,e,f,g segments when i. d3d₂d₁do= (0100) 2 ii. d3d₂d₁do = (0111)₂ iii. d3d2d₁do (1000)2

Determine the simplest Boolean expression of Q (see truth table below). The symbol x means "don't care", so either 0 or 1; it is your choice in order to get the simplest expression. Loop does not recognize the NOT symbol: X, use NOT(X) instead, similarly for X. Y, use NOT(X.NOT(Y)). Use capital letters. ABCQ 0000 0011 0101 0 1 1 1000 X 10 11 1 10 X 1 1 1 1

Translate into logical notation, using "kxy" for x knows y, "a" for Alma. For the statement "Some who know themselves know Alma". Formal Logic