Please Provide me all necssary Screenshort and Commentds:(I use eclipse)

Write two programs for Box Stacking Problem

1.Brute Force Program and

2.Dynamic Program either button up or top down

Box Stacking Problem is explained in lecture powerpoint slides 11, 13, 14 : Is below-

This the 3 slide with explaination.

Box Stacking Problem Having n boxes, each of which must be in a certain orientation The i-th box has a height h, and base wi x d, (where the width and the depth are interchangeable). . Your goal is to make the highest possible stack of boxes, holding to the following constraint: . A box k can only be stacked on top of a box m if the wyS Wm and d, sdn Box Stacking Problem Having n boxes, each of which must be in a certain orientation The i-th box has a height h, and base wi x d, (where the width and the depth are interchangeable). . Your goal is to make the highest possible stack of boxes, holding to the following constraint: . A box k can only be stacked on top of a box m if the wyS Wm and d, sdn