Consider a point-to-point communication network represented by a graph. In terms of the graph parameters, the maximum delay (quality of service) experienced by a packet employing Bellman-Ford routing algorithm is/ are:
1) diameter of the graph
2) shortest path on the graph
3) sum of all edge weights in te graph
Select the correct using the code given below: