SCENARIO B:

Suppose you have a four-activity sequential process. Throughput capacities (in units per hour) are shown in parentheses:

Task 1 (6) ---> Task 2 (5) ---> Task 3 (4) ---> Task 4 (6).

No buffers exist between tasks, so an upstream task must wait if the downstream task is busy.

1. Refer to scenario B. Which task(s) would be blocked? Check all that apply.

A. 1

B.2

C.3

D.4

E.5

2. Refer to scenario B. Which task is the bottleneck?

A.1

B.2

C.3

D.4