$)$ Box Allocation Problem: In class, we discussed the optimization problem of locating

boxes of given height into two bins such that the bin with the maximum height has the minimum possible

height, and derived a mathematical formulation for it$.$ Write a Mathematical Programming formulation

$($Decision Variables, Contraints, Objective$)$ for this problem in the case that instead of two $(2)$ bins, there

are three $(3)$ bins $($or in the more general case of m bins and n boxes with heights hi

$,$ i $=1,...,$ n$,$ if you

prefer$).$