A thief enters a house to rob. He can carry a maximum weight of $13kg$ into his bag. There are $5$ items in the house with the following weights and values.

$\backslash$table$[[$Item$,$Weight,Value$],[1,2,3],[2,3,6],[3,4,5],[4,6,12],[5,9,10]]$

Requirements:

i$)$ Solve the following $\frac{0}{1}$ knapsack problem using branch and bound.

ii$)$ What items should thief take with him?

iii$)$ Write a pseudocode and calculate the time complexity.

iv$)$ Implement the above problem statement using any programming language