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