Consider the following C++ function where all variables are single bits: boolean FunctionZ(boolean a, boolean b, boolean c){ boolean x=a&bc; boolean y=(xa); return y; a) Draw the logic design that is a direct representation of this function (without simplifying). Bad drawings will lose points! b) .Use algebraic simplification to simplify this function and write it as a "sumproducts" format. Start off with this expression (as taken from the program functio y=(xa)