Problem 9 (10 points): Consider the network topology of Figure 3. The number shown next to cach link is the probability of the link failing during the lifetime of a virtual circu fro ode A to node B. It is assumed that links fail ndependently from cach other. Find the most reliable path from A to B using a modified version of a shortest-path algorithm of your preference. Make sure to show al iterative steps in the application of the shortest-path algorithm. Hint: end-to-end path reliability can be calculated as the product of link reliabilities on that path. And link reliability is 1-link failure probability 0.05 0.06 0.02 0.01 0.01 0.02/0.0 .03 0.03 0.03 0.04 Figure 3: Network topology and associated link failure probabilitics. Problem 9 (10 points): Consider the network topology of Figure 3. The number shown next to cach link is the probability of the link failing during the lifetime of a virtual circu fro ode A to node B. It is assumed that links fail ndependently from cach other. Find the most reliable path from A to B using a modified version of a shortest-path algorithm of your preference. Make sure to show al iterative steps in the application of the shortest-path algorithm. Hint: end-to-end path reliability can be calculated as the product of link reliabilities on that path. And link reliability is 1-link failure probability 0.05 0.06 0.02 0.01 0.01 0.02/0.0 .03 0.03 0.03 0.04 Figure 3: Network topology and associated link failure probabilitics