part c and part d needed. ans asap please thanks

2. Freight Transport A clothing manufacturer is preparing their supply chain for a sales period. a. The table below presents their sales figures over the last 12 months. Month 1 2 3 4 5 6 7 8 9 10 11 12 Demand 3328 3433 3438 3381 3435 3234 3346 3291 3196 3178 3312 3263 Use the 3-month moving averages and simple exponential smoothing (using a 0.7 coefficient) to calculate the expected sales for the period, leading up to month 13. [8 marks] b. Carry out a forecasting error analysis to identify the approach that provides a better forecast. [6 marks] C. Use the nearest neighbour algorithm to find a solution for the travelling salesman problem, that establishes a tour across all customer locations for a vehicle that departs from the depot. [3 marks] Depot 1 2 3 Depot 1 2 3 4 5 6 7 8 10 16 12 44 29 29 18 35 10 0 41 29 9 22 37 23 14 16 41 0 27 48 32 18 31 5 12 29 27 0 49 31 33 7 33 44 9 48 49 0 28 35 21 15 29 22 32 31 28 0 32 34 50 29 37 18 33 35 32 0 43 43 18 23 31 7 21 34 43 0 20 35 14 5 33 15 50 43 20 0 4 5 6 7 8 d. Is the tour that you obtained above optimal? Why? What additional steps would you take in order to improve the quality of the solution? [3 marks] 2. Freight Transport A clothing manufacturer is preparing their supply chain for a sales period. a. The table below presents their sales figures over the last 12 months. Month 1 2 3 4 5 6 7 8 9 10 11 12 Demand 3328 3433 3438 3381 3435 3234 3346 3291 3196 3178 3312 3263 Use the 3-month moving averages and simple exponential smoothing (using a 0.7 coefficient) to calculate the expected sales for the period, leading up to month 13. [8 marks] b. Carry out a forecasting error analysis to identify the approach that provides a better forecast. [6 marks] C. Use the nearest neighbour algorithm to find a solution for the travelling salesman problem, that establishes a tour across all customer locations for a vehicle that departs from the depot. [3 marks] Depot 1 2 3 Depot 1 2 3 4 5 6 7 8 10 16 12 44 29 29 18 35 10 0 41 29 9 22 37 23 14 16 41 0 27 48 32 18 31 5 12 29 27 0 49 31 33 7 33 44 9 48 49 0 28 35 21 15 29 22 32 31 28 0 32 34 50 29 37 18 33 35 32 0 43 43 18 23 31 7 21 34 43 0 20 35 14 5 33 15 50 43 20 0 4 5 6 7 8 d. Is the tour that you obtained above optimal? Why? What additional steps would you take in order to improve the quality of the solution? [3 marks]