Convert the following truth table into a boolean expression. Is my answer (written in red ink) correct? The subject of this problem is computer organization.

3. Convert the following truth table into a boolean expression. w x y z I f(w,x, y, z) -0-0 0-0 or 0 0 0 1 0 0 1 1 0 1 0 0 1 0-1 0 1 0 1 0 1-0 or 1 1 1 0 1 1 1 1 I 1 Boolean expression Or (And (And (Not (w),Nat(x)), And UNotly), Z)), And And (Not (w) x), And Notly), Nottz) And And (WNotlx)) And Net(2))), And(And W, x), And ly, Not UZ))), And (And (w,x), And lyiZ)))