Problem 5. (15 pts) Suppose that you have 7 full wine bottles, 7 half-full, and 7 empty. You would like to divide the 21 bottles among three individuals so that each will receive exactly 7 . Additionally, each individual must receive the same quantity of wine. Express the problem as MILP constraints and find a solution in CVXPY. (Hint: Use a dummy objective function in which all the objective coefficients are zeros.)