1. Given the following \( 0-1 \) knapsack problem with \( \mathrm{W}=13 \mathrm{~kg} \) : Draw the pruned state space tree and show the actions step by step using: (a) Depth-first search ( \( \mathbf{1 5} \) marks). (b) Breadth-first search ( \( \mathbf{1 5} \) marks). (c) Best-first search ( \( \mathbf{1 5} \) marks).
