Use a Karnaugh Map to find the minimum AND-OR expression for x(a,b,c):
For part a the answer is: x(a, b, c) = ac + b'c'
How do I get that answer? I know from the problem that x=1 at rows 0, 4, 5, and 7 of the respective truth table (which is not given), however I thought x can only equal 1 if a, b, and c are all 1 by the definition of AND? I'm just confused how truth tables work for inputs I suppose.