Please show explicit steps for Q3.

The following table shows the times required to complete each of seven jobs in a two-machine flow shop. Each job must follow the same sequence, beginning with Machine 1 and moving to Machine 2. Job Times (Hours) b d f a g 9 7 15 16 10 12 Machine 1 Machine 2 8 10 8 12 12 11 9 14 1. [3 marks] Determine a sequence that will minimize the makespan. 2. [4 marks) Construct a chart of the resulting sequence, and find the optimal makespan. 3. [3 marks] Suppose job c takes a longer time on Machine 2 (job time increases from 12 hours to 12 + 1 hours), and everything else remains unchanged. What is job c's job time on Machine 2 if the optimal makespan becomes 1 hour longer than that in