1.  Draw the BDDs for all 16 Boolean functions f(x1, x2). What are their sizes?
3.  How many Boolean functions f(x1, . . ., xn) have BDD size 3 or less?
4.  Suppose three fields have been packed into a 64-bit word x, where
V occupies 8 bits and the other two fields occupy 28 bits each. Show that five bitwise ...