Could you explain this question? The correct answer is c. [0,3,5,5]

Consider the space-optimized version of the algorithm for knapsack01 (pseudo-code on the slides), what is the result of applying this 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,3,5] B=[0,5,5,5] B=[0,3,5,5] B=[0,3,5,0]