$[$Write down the answer of the following questions. All questions have equal marks$]$

Why does Dijkstra's shortest path algorithm not work with negative weight edges?

Explain.

Why does the Bellman$-$Ford algorithm need to relax each edge $n$ times, where $n$ is the

number of vertices in the graph? What will happen if edges are relaxed less or more than

$n-1$ times?

How does the Bellman$-$Ford algorithm identify whether there is a cycle in the graph?

Explain with an example.

Discuss the Edmond$-$Carp modification of the classical Ford$-$Fulkerson network flow

algorithm.

Let $G$ be a graph with three sources $(s1,s2,s3),$ two sinks $(t1,t2)$ and a positive integer

capacity on each edge. Explain how it can be converted to a standard maximum$-$flow

problem.