(b) A museum wants to ship 8 Roman statues for a special exhibition. They are to be transported in crates each holding a maximum weight of 300 kilograms. The numbers in the table represent the weight in kilograms of the statues: Statue Weight [kg] Mercury 40 Venus 50 Tellus 60 Mars 40 Jupiter 250 Saturn 200 Caelus 70 Neptune 190 (i) Find the lower bound l for the number of crates required to fit all statues. (2 marks) (ii) Use the first fit decreasing algorithm to estimate the minimum number of crates required to ship all statues. Does the first fit decreasing algorithm give an optimal solution? (6 marks) (iii) Find by trial and error a solution needing only I crates. (4 marks)