write a java program for box stacking problem using both dynamic and recursive method.

note: 1, creat a partial ordering of the boxes box1, box2,...., boxn such that for all i,j with i

2, denote the height of the tallest stack of boxes with box j on the top as H(j).

Thank you.