A 4-input lookup table (LUT) in an FPGA can directly represent any Boolean function of up to four variables because it stores how many truth-table output bits?

Explanation: Four binary inputs have 2^4=16 possible combinations. A 4-input LUT stores one output value for each combination, so 16 configuration bits represent an arbitrary four-variable Boolean function.