What is the correct recurrence relation for all pair shortest path using…

1. A.

   AK(i, j) = min{ AK-1(i, K) + AK-1(K, j), AK-1(i, j)}

2. B.

   AK(i, j) = min{ AK+1(i, K) + AK+1(K, j), Ak+1(i, j)}

3. C.

   AK(i, j) = min{ Aj-1(i, K) + Aj-1(K, j), Aj-1(i, j)}

4. D.

   AK(i, j) = min{ Aj+1(i, K) + Aj+1(K, j), Aj+1(i, j)}

Attempted by 208 students.