Neglecting the flight departure time differences as you are now going to estimate the profit earning first, i.e., the current objective function is maximising the total profit. The aircraft routing problem will be handled by the airlines afterwards. Also assume passengers can transfer between airports in the same city, i.e., HND-NRT and ITM-KIX. The following profit per unit table is shown as follows. Table 4 Table 5 a. Considering only the problem in Table 4, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) b. Considering only the problem in Table 4, formulate the integer programming problem. (10 marks) c. Considering only the problem in Table 5, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) d. Considering only the problem in Table 5, formulate the integer programming problem. (10 marks) e. Combine (b) and (d), formulate the integer programming problem. (6 marks) Neglecting the flight departure time differences as you are now going to estimate the profit earning first, i.e., the current objective function is maximising the total profit. The aircraft routing problem will be handled by the airlines afterwards. Also assume passengers can transfer between airports in the same city, i.e., HND-NRT and ITM-KIX. The following profit per unit table is shown as follows. Table 4 Table 5 a. Considering only the problem in Table 4, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) b. Considering only the problem in Table 4, formulate the integer programming problem. (10 marks) c. Considering only the problem in Table 5, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) d. Considering only the problem in Table 5, formulate the integer programming problem. (10 marks) e. Combine (b) and (d), formulate the integer programming problem. (6 marks)