There is exactly one cubic box of edge length e(0). Call this box B(0).There are m(1) cubic boxes (each called B(1)) of edge length e(1).There are m(2) cubic boxes (each called B(2)) of edge length e(2).There are m(3) cubic boxes (each called B(3)) of edge length e(3)................There are m(n) cubic boxes (each called B(n)) of edge length e(n).Let N=m(1)+m(2)+m(3)+...+m(n).We are given that e(0)>e(1)>e(2)>...>e(n).We want to insert all the N boxes B(1), B(2),..., B(n) into box B(0).It is allowed to insert a smaller box into a larger box.In how many ways can this be done?Do the above for e(0)=7, e(1)=3, e(2)=1, m(1)=2, m(2)=3.