Eight cities A, B, C, D, E, F, G and H are connected with one-way roads R1, R2, R3, R4, R5 and R6 in the following manner:R1 leads from A to C via B; R2 leads from C to D and then via B to F; R3 leads from D to A and then via E to H; R4 leads from F to B via G; R5 leads from G to D; and R6 leads from F to H. The minimum number of road segments that have to be blocked in order to make all traffic form B to D impossible is

Eight cities A, B, C, D, E, F, G and H are connected with one-way road

1.	Eight cities A, B, C, D, E, F, G and H are connected with one-way roads R1, R2, R3, R4, R5 and R6 in the following manner:R1 leads from A to C via B; R2 leads from C to D and then via B to F; R3 leads from D to A and then via E to H; R4 leads from F to B via G; R5 leads from G to D; and R6 leads from F to H. The minimum number of road segments that have to be blocked in order to make all traffic form B to D impossible is
A.	5
B.	4
C.	3
D.	2
E.	1
Answer» E. 1