A) The appropriate linear programming problem can be formulated as follows:
Let X be the number of Type A garden sheds to be built.
Let Y be the number of Type B garden sheds to be built.
Objective function: Maximize profit = 60X + 84Y
Subject to the following constraints:
2X + 3Y ≤ 30 (machine time constraint)
5X + 5Y ≤ 60 (craftsman time constraint)
X, Y ≥ 0 (non-negativity constraint)
B) Using the graphic method, we can plot these constraints on a graph and find the feasible region. The feasible region represents all the combinations of X and Y that satisfy the constraints.
C) To determine how many garden sheds of each type to build in order to maximize the total profit using the simplex tableau method, we would need the coefficients of the objective function, the constraint inequalities, and the right-hand side values of the constraints.
D) The amount of the scarce resource that is unused (slack) by the firm can be determined by finding the difference between the available resources and the resources used by the optimal solution. In this case, it would be the difference between the available machine time (30 hours) and the machine time used by the optimal solution, as well as the difference between the available craftsman time (60 hours) and the craftsman time used by the optimal solution.
E) The recommendation to the firm would depend on the optimal solution obtained from the linear programming problem. This solution would indicate the number of Type A and Type B garden sheds to build in order to maximize the total profit, considering the constraints and available resources.