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?
A. 1
B. 2
C. 3
D. 4

C

Explanation: Computing Device A is connected using 3 wires, which all lead to multiple different paths of wires. If you break all the wires off of A, it leaves it with no paths to use. However, if you do this with E, there is 4 differents paths connected to it. Since you need the MINIMUM, the answer would be C.