Truth Table 3 shows representation of a Boolean function. XYZ F(X,Y,Z) 0 0 0 1 1 0 1 0 1 0 1 0 1 0 0 1 1 1 1 1 Table 3: A Truth Table of a function F(X,Y,Z) 0 0 0 0 1 0 1 1 1 1 1 1 (a) Write the Boolean function F(X, Y, Z) that the Truth Table 3 represents. (b) Simplify the function you obtained from the Truth Table 3. (c) Using only NAND gates draw a combinatorial circuit to implement the simplified circuit.