Dynamic Programming, Assembly Line Scheduling problem is to compute the fastest path through the factory. Modify the algorithm for it to find both fastest and second fastest paths through the factory. Show the details of how you would modify the algorithm to satisfy the new requirements.