Knapsack problem & all-pairs shortest path with matrix help

NO CODING. ONLY WRITE PSUEDO CODE PLEASE

Apply the bottom-up dynamic programming algorithm to the following instance of the knapsack problem for a knapsack of capacity W = 6: Solve the all-pairs shortest path problem for the digraph with the following weight matrix: [0 5 infinity infinity 3 2 0 infinity infinity infinity infinity 3 0 2 infinity 1 2 1 0 infinity 7 infinity infinity 3 0] Also draw the digraph whose weight matrix is given above