Answer from cs61c-as (Gerardo Bonilla 15311015) for Question 1
with N inputs there can be a maximum of 2^N combinations, assuming all these combinations result in a 1 product then there will be 2^N terms in the functions canonical sum-of-products.