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 /are1. diameter of the graph2. shortest path on the graph3. sum of all edge weights in the graphSelect the correct answer using the code given below.

Consider a point – to point communication network represented by a g

1.	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 /are1. diameter of the graph2. shortest path on the graph3. sum of all edge weights in the graphSelect the correct answer using the code given below.
A.	1 only
B.	2 only
C.	3 only
D.	1, 2 and 3
Answer» C. 3 only