the truth table below exhibiting all 16 Boolean functions of 2 variables. How many Boolean functions are there with only one 1 specified in its column (primitive functions or min terms)? How many Boolean functions have two 1's specified in its column (intermediate functions)? How many Boolean functions have three 1's specified in its column (max terms) Each function has a column header exhibiting the logical implementation of that function. For instance, column is interpreted as , that is \"not x _ _ xy x y AND not y\". Note this column specifies a 1 only when x = y = 0. Conjunction, or the logical AND function, is specified by adjacent variables, as we would specify a multiply in an algebraic equation. Note the column , representing x y exclusive or, interpreted as x y x y . Disjunction, or logical OR, is specified as a + in our column headers. Using the distributive, absorption, unit property and identity laws from table 5 of section 12.1 of the text, can you exhibit how each of the intermediate functions , , x, y, and can be formed as the disjunction (logical OR) x y xy _ x _ y of primitive functions? For instance, _ _ x y xy x y y x1 x. Note the use of the distributive, unit property and identity laws. Can we claim that the disjunction or logical OR of each unique pair of primitive functions (min terms) yields a unique intermediate function? Is it possible that all Boolean functions, with the exception of the 0 function, can be formed as a logical OR of the primitive functions? _ _ _ _ xy 0 x y x y xy x y ( x y ) 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 1 0 1 _ _ 1 1 0 0 1 0 0 1 _ _ _ _ ( x y) x y x y ( x y) ( x y) ( x y) ( x y) 1 1 0 1 0 0 0 1 1 0 1 1 0 0 1 1 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 1 1