Build a solution for the $0-1$ Knapsack problem using best$-$first search algorithm $($Ch$.6\mathrm{.}1\mathrm{.}2).$

We have $5$ items with price and weight $($p$/$w$)$:

$$50/20$

$$30/5$

$$40/10$

$$10/5$

$$20/4$

Limitation on the weight is: W $=22.$

Find a sequence of visited nodes, find a final solution.