SuperMalls Inc. runs a chain of shopping malls across the UK. Recently, SuperMalls has purchased a 10,000 sq ft building in central London, and the board is wondering how they should rent out the space in order to maximise profits. The following table presents the different types of shops that have shown an interest in renting space at the mall, together with the required space per shop, the minimum and maximum number of each shop type that SuperMalls wants to have at the mall, as well as the anticipated profits that each shop would generate (in 1,000s). Shop type Department Accessories Space (sq ft) 2,500 Minimum # Maximum # Profits 1 30 600 3 8 Clothes 1,200 3 20 Book Shoe 900 1 2 15 500 3 10 (a) Assume that SuperMalls receives a profit contribution of 3% from each shop at the mall. How many shops of each type should SuperMalls have in the mall in order to maximise its profits? Derive an Integer Program that solves the problem. Do not solve the problem! (b) Explain how to formulate the following constraints that could be added to the Integer Program in part (a): 1. There should not be both clothes stores and shoe stores. 2. The overall space occupied by the clothes and shoe shops should not exceed 2,000 sq ft. 3. If there is a shoe store, then there should be at least one clothes store (c) Consider again the problem from part (a), but assume now that the profits of each shop depend on the number of shops of that type that are present in the mall: Shop type Department 8 1 Store 2 Stores 3 Stores 30 25 20 Accessories 7 Clothes 20 17 12 ook 15 13 10 Shoe 10 9. 8 For example, 1 department store generates 30,000 profits per year and requires 2,000 sq ft of space, whereas 2 department stores generate 2 * 25,000 profits per year and require 2 * 2,000 sq ft of space and 3 department stores generate only 3 * 20,000 profits per year while requiring 3 * 2,000 sq ft of space. How many shops of each type should SuperMalls now rent out to in order to maximise its profits? Derive a Binary Program that solves the problem. Do not solve the problem!