Answer from cs61c-ck (Allen Lee 16583554) for Question 1
According to the reading, if we make a truth table for this arbitrary function, we'd have one product term for each "row" (possible combination of input) that produces a 1 in the output.  Thus, if we had a function that always produces 1 for its output, regardless of its inputs, then we'd have 2^N product terms, which is also the total possible number of different combinations of inputs.