Question

the figure below represents a network of physically linked computers labeled a through g. a line between two computers indicates that the computers can communicate directly with each other. any information sent between two computers that are not directly connected must go through at least one other computer. for example, information can be sent directly between computers a and b, but information sent between computers a and c must go through other computers. 8 mark for review what is the minimum number of connections that must be broken or removed in the network before computer e can no longer communicate with computer f? a 1 b 2 c 3 d 4

Explanation:

Step1: Analyze paths between E and F

There are multiple paths between computer E and computer F. We need to find the minimum - cut set.

Step2: Identify key connections

By observing the network, we can see that if we break the two direct connections between E and F (the two lines directly linking them), E and F will no longer be able to communicate.

Answer:

B. 2