Suppose that a and b are boolean variables. Show that the expression
(!(a && b) && (a || b)) || ((a && b) || !(a || b))
evaluates to true.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.