Slve the problem of minimizing 3x1 4x2 subject to 2x1

Question

Solve the problem of minimizing 3x₁ + 4x₂ subject to 2x₁ + 3x₂ ≥ 10 and x₁, x₂ ∈ {0, 1, 2, 3} using branch and relax without bounds propagation.

Now, solve it using branch and infer without relaxation.

Finally, solve it using branch and relax with propagation. Which results in the smallest search tree? (When using branch and infer, follow the common constraint programming practice of branching on the variable with the smallest domain.)