LIST THE BOOLEAN EXPRESSIONS AND HOW YOU GOT THEM.

1. List the boolean expression from F0-F15
2. Build the boolean function table for 3 input variables. How many M possible functions we can derive from 3 input variables?
3. List the boolean expression from F0-FM for selective 16 functions from #2 table
4. Apply simplification theorems on 16 functions if applicable.

There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs Y F xport " 0 0 1 1 Y 0 0 0 1 0 0 0 1 0 1 OoO 0 0 0 1 1 0 1 0 16 possible functions (FO-F15) 0 0 0 1 1 1 1 1 1 1 0 0 0 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 OOOH 1 1 1 1 0 1 1 0 1 1 1 1 0 X and Y X not Y X xor Y X or Y X= Y X nor Y not (X or Y) 1 not x X nand Y not (X and Y)