K-maps - Computer Processors

Need help with question 4

Please answer correctly for thumbs up

For each of the following boolean formula construct a truth table (T, and false respectively) 1. denote true 2. For each truth table in Question 1 construct an equivalent boolean formula in disjunctive normal form (DNF). 3. For each truth table in Question 1 construct an equivalent boolean formula in conjunctive normal form (CNF). Using Karnaugh maps minimise each of the formula in Question 1 to an equivalent, but "shorter", expression. 4. For each of the "shorter" expressions produced in Question 4 construct a syntax tree of the expression and draw a logic diagram using the symbols introduced in this module. 5