Kill it before it spreadsComputer Science Level pending
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?