Given the following circuit diagram: Determine the Boolean function F(A, B, C) implemented by this circuit. Reduce F using Boolean algebra to an expression with minimum literals and draw the simplified circuit. Using algebraic manipulation, express the function F as a sum of minterms. Express the function F in terms of minterm expansions. Draw the truth table for function F. Show using K-map that the function obtained in stage (ii) is indeed the minimal function