Consider an instance of UFL $($uncapacitated location facility$)$ with m$=6,$ n$=5,$ delivery costs cij$=([6,2,1,3,5],[4,10,2,6,1],[3,2,4,1,3],[2,0,4,1,4],[1,8,6,2,5],[3,2,4,8,1])$ and fixed costs f$=(4,8,11,7,5).$ Using the dual vector u$=(5,6,3,2,6,4),$ solve the lagrangean subproblem IP$($u$)$ to get an optimal solution $($x$($u$),$y$($u$))$ and lower bound z$($u$).$ Modify the dual solution $($x$($u$),$y$($u$))$ to construct a good primal feasible solution. How far is this solution from optimal?