Given a 2D bin of width W, allocate N rectangles of sizes w_k x h_k so that the height of the packed rectangles is minimal. Write a Matlab function that given an order of the rectangles to be packed and their orientation, puts them from left to right and as low as possible (see below). Implement a simple algorithm that randomly swaps the order of two rectangles and (randomly) changes their orientation (the updated order is accepted if it reduced the objective function value). Visualize the process. Bin packing problem for 40 rectangles (W = 12). Initial order (left) and optimized order (right) Given a 2D bin of width W, allocate N rectangles of sizes w_k x h_k so that the height of the packed rectangles is minimal. Write a Matlab function that given an order of the rectangles to be packed and their orientation, puts them from left to right and as low as possible (see below). Implement a simple algorithm that randomly swaps the order of two rectangles and (randomly) changes their orientation (the updated order is accepted if it reduced the objective function value). Visualize the process. Bin packing problem for 40 rectangles (W = 12). Initial order (left) and optimized order (right)