Hi there, i'm new to this community, but need URGENT help with two questions. i'm doing a subject on computer science, and regretfully my book is to know help in assisting me to answer the following two questions...if any one can help, it would be greatly appreciated
write boolean expression in sum-of-minterms form: F(A, B, C) = A
show all steps in m-notation (do not use truth table or karnaugh map)
use only boolean algebra to simplify boolean expression. first determine f1 and f2 then simplify showing all steps.
F1 = x'(wy')' + x'wy'
F2 = (xw +w')'
F(w, x, y) = F1 + F2
i would really appreciate it. i have no idea what is going on here and really need help as my assignment needs to go in ASAP.