Given the function $$F = P′ + QR,$$ where $$F$$ is a function in three Boolean variables $$P,Q$$ and $$R$$ and $$P'=!P,$$ consider the following statements.

$$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S1} \right)\,\,\,\,F = \sum {\left( {4,5,6} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S2} \right)\,\,\,\,F = \sum {\left( {0,1,2,3,7} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S3} \right)\,\,\,\,F = \sum {\Pi \left( {4,5,6} \right)} \cr & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\left( {S4} \right)\,\,\,\,F = \sum {\Pi \left( {0,1,2,3,7} \right)} \cr} $$

Which of the following is true?

The total number of prime implicants of the function
$$f\left( {w,x,y,z} \right) = \sum {\left( {0,2,4,5,6,10} \right)} $$ _________________.

The number of min-terms after minimizing the following Boolean expression is _______________ . $$$\left[ {D' + AB' + A'C + AC'D + A'C'D} \right]'$$$

A half adder is implemented with $$XOR$$ and $$AND$$ gates. A full adder is implemented with two half adders and one $$OR$$ gate. The propagation delay of an $$XOR$$ gate is twice that of an $$AND/OR$$ gate. The propagation delay of an $$AND/OR$$ gate is $$1.2$$ microseconds. A $$4$$-bit ripple-carry binary adder is implemented by using four full adders. The total propagation time of this $$4$$-bit binary adder in microseconds is____________ .