Draw a logic circuit corresponding to the following logic statement:
x = 1 if ( a = not 1 or b = 1 ) and ( b = not 1 and c = not 1)

OK, I'll try this.  But you have to be gentle with me, because it's 43 years
since I learned it, and I've never used it except for recreation.  I just hope
that I don't make a fool of myself.

The logic function you want is:      X = ( A + B ) ( B C )

-- ' X ' requires  B  in the second parentheses.

-- So in order for ' X ' to be true, the first parentheses depends only on  A .
We can completely ignore the ' B ' there, because if  ' B ' is true, then ' X '
is not.

-- So the whole function reduces to    X = ( A ) ( B C )  =  ( A B C )

If I recall my tool box from way back then,    ( A B C )  =  ( A + B + C ) .
That's a law named after somebody whose name escapes me,
but I think I've applied it correctly.

Anyway, as always happens, the function can be implemented in
two different fundamental ways, on account of this guy's law.
Both of them are presented in the attachment.

Answer(d) readers name,your name,the date,the subject,and the body of the memo;