What is the minimum number of intermediate operations that can fill in each box [M, N, O, P] to have the pipeline complete given any intermediate operation? 

A. [0, 0, 0, 1]

B. [0, 0, 1, 0]

C. [0, 0, 1, 1]

D. [1, 1, 0, 1]

E. [1, 1 ,1, 0]

F. [1, 1, 1, 1]

Transcribed Image Text:

Source Finite Stream Source Finite Stream Source Infinite Stream Source Infinite Stream Source Intermediate Operation Box M Box N Box O Box P Terminal Operation count () findFirst() count() findFirst()