4) A carpenter is planning to make chairs and tables with the remaining resources he has left. He plans to sell tables for $50 and chairs $20. A table uses 3 pieces of wood and a chair uses 1 piece of wood. He spends the same time for making a table and chair, 1 hour. He has 12 pieces of wood left and 5 hours available. Formulate the problem and solve this problem as integer programming problem by using branch and bound algorithm to maximize the total profit.