This diagram shows a number of computing devices connected to the Internet with each line representing a direct connection.
What is the MINIMUM number of paths that would need to be broken to prevent Computing Device A, from connecting with Computing Device E.
(basic idea of the graph:
A -> C, B, D
D -> B, E, G
B -> A, D, E, C
C -> A, B, F
F -> C, E
E -> D, B, F, G
G -> D, E
A, all the way to left, next row is D B C, next row, E and F, last row, G
A. 1
B. 2
C. 3
D. 4
