urgent!!

Reduce the following Boolean expressions using only Boolean algebra as much as possible. Show all your work. (Do NOT use truth tables or K-maps for this question) a) F = (A + C).(A.D + A.D') + A.C + C + B.(A.B') + A (7 pts.) b) F = A.(B'+B.C) +B'. (C+D)' + (B.C)' (7 pts.) c) F= (A + B + C +D) (A' + B'+ C + D"). (A' + C).(A + D) (B+C+D) (6 pts.) Show your work clearly not only the final