Consider the following boolean function given by its truth table: (a) Construct a binary decision tree for f(x,y,z) such that the root is an x-node followed by y - and then z-nodes. (b) Construct another binary decision tree for f(x,y,z), but now let its root be a z-node followed by y - and then x-nodes..