Need help with #3 please

Problem 1: Reduce the following Boolean functions to the minimum number of literals: (a) xy + xy' (d) a'be + abc + abc + a'bc' Problem 2: Reduce the following Boolean functions to the indicated number of literals: (a) A'C' + ABC + AC to three literals (b) A'B(D' + C'D) +B(A + ACD) to one literal Problem 3: Draw logic diagrams of the original and simplified Boolean functions in Problem 1. Problem 4: Find the complement of the following Boolean functions: (a) ry' + x'y (b) (a + c)(a + b)(a'+b+c) Problem 5: Write down the truth table of F = bc + ald