Kill it before it spreads

A worm is a standalone malware program that replicates itself in order to spread. It often uses a computer network to spread itself, relying on security failures on the target computer to access it. Unlike a computer virus, it does not need to attach itself to an existing program. Studies have shown that the replication is heavily related to the topology of the network.

The above adjacency matrix represents the network (a directed graph). The weight of the edge between $a$ and $b$ is the probability of the worm moving from $a$ to $b$ . Suppose the worm moves from node $1$ to node $5$ . Which of the following is the least probable path it will take?