If instructions are executed in parellel, whenever the required operands are available, then the execution time of the previos problem is logically same as that of subsiquently executing:

(A) 3 statements
(B) 2 statements
(C) 4 statements
(D) 5 statements