Could you explain this step by step on how we find these values. The pseudocode is below. The answer is a. [0,3,6,9]

(Follow up on the previous one). Suppose that we change the space-optimized version of the algorithm for knapsack01 in letting the w increase from wk to W (instead of decrease). What is the result of applying the modified version of the algorithm to the set consisting of item 1 with w1=1 and b1=3, and item 2 with w2 =1 and b2=2, and total capacity W=3 ? B=[0,3,6,9]B=[0,3,3,5]B=[0,3,5,5]B=[0,5,7,7] Algorithm 01Kn apsack (S,W) : for w:=0 to W do B[w]:=0 for k:=1 to n do for w:=k,,W if B[wwk]+bk>B[w] then B[w]:=B[wwk]+bk