1. Single Source Shortest Path Problem. Suppose Dijkstras Algorithm is run on the following graph starting from the vertex A. Complete the table showing the intermediate distance values at each iteration.

2. 0-1 Knap Sack Problem Array S[ ] has the size of items available for selection. Given an integer K (the size of a knap sack) and n items of different sizes such that ith- item has an integer size S[i], find a selection of subset of items whose sizes sum to exactly K, or determine that no such subset exists. No fractional selection is permitted.

K = 14 // knap sack size // items S[1] = 2, S[2] = 4, S[3] = 7, S[4] = 8

1. Single Source Shortest Path Problem. Suppose Dijkstra's Algorithm is run on the following graph starting from the vertex A. Complete the table showing the intermediate distance values at each iteration. 2. 0-1 Knap Sack Problem Array S [ ] has the size of items available for selection. Given an integer K (the size of a knap sack) and n items of different sizes such that ith - item has an integer size S[i], find a selection of subset of items whose sizes sum to exactly K, or determine that no such subset exists. No fractional selection is permitted