1. Let X (x3 x2 X1 Xo) represent a four-bit integer that is non-negative, where xo represents the least- significant bit and x3 represents the most-significant bit (this bit significance will be assumed of all integers discussed in this course) a. (10 points) Draw the truth table for output F such that F-1 if X is a multiple of 5 b. (20 points) Design a circuit that will implement F via the truth table in part a. Your circuit can only use NOT gates and NAND gates. c. (10 points) Let the cost of a logic circuit be the total number of gates plus the total number of inputs to all the gates in the circuit. What is the cost of the circuit in part b