Solve the following knapsack problem by branch and bound using depth first right.

Maximize 15x₁ + 8x₂ +12x₃+4x₄

subject to 3x₁+2x₂+6x₃+4x₄<=10

x1,x2,x3,x4 {0,1}