Digital Assignment-1 1. Solve the below assembly line scheduling problem using dynamic programming. Problem Statement: A manufacturing company has two assembly lines, each with n stations. A station is denoted by Si,j where i denotes the assembly line the station is on and j denotes the number of the station. The time taken per station is denoted by ai,j. Each station is dedicated to do some sort of work in the manufacturing process. So, a chassis must pass through each of the n stations in order before exiting the company. The parallel stations of the two assembly lines perform the same task. After it passes through station Si,j, it will continue to station Si,j+1 unless it decides to transfer to the other line. Continuing on the same line incurs no extra cost, but transferring from line i at station j1 to station j on the other line takes time ti,j. Each assembly line takes an entry time ei and exit time xi. Give an algorithm for computing the minimum time from start to exit. Objective: To find the optimal scheduling i.e., the fastest way from start to exit. Note: let fi[j] denotes the fastest way from start to station Si,j