write a program yang dynamic programming strategy to implement each of the following problem Attictory has two cambly in en with stations. A station denoted by, where is either or 2 and indicates than bly in the station is on, and indicates the number of the nation. The time taken per station in denoted by Each station decicated to one or at work engine fitting body to painting, and so on So.. chattin must goes through each of the nation in order bare et the actory. The paralisation of the two assembly is perform the same as After sevechan will continue to station Siness it decides to to the other Continuing on the same in tuttarting from a station - 1 to Mution the other in tako nety Dachy line entry time and time which may be strene for the toolin Given algorithm for computing the time it will take told The benefare present the problem incleic Reddy Assembly tinel Painting Engine hing SU thing A. Eingine 13,1 fisting Body mine Painting Line Note: Read exactly the values stated below to: 2,0, 2, 1, 12, 13,6-1:21 in the same order from the user and the display the minimur time bang umber of station 4 414 10.10. 231317.4.2. 121 110 21,7 But Me Format su 35 #522101 4520 12 12 107 Write a program employing dynamic programming strategy to implement each of the following problem. A car factory has two assembly lines, each with n stations. A station is denoted by Suj where i is either 1 or 2 and indicates the assembly line the station is on, and jindicates the number of the station. The time taken per station is denoted by aj. Each station is dedicated to some sort of work like engine fitting, body fitting, painting, and so on. So, a car chassis must pass through each of the n stations in order before exiting the factory. The parallel stations of the two assembly lines perform the same task. After it passes through station Sij, it will continue to station Su+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 3 - 1 to station on the other line takes time tij. Each assembly line takes an entry time e and exit time xi which may be different for the two lines. Give an algorithm for computing the minimum time it will take to build a car chassis. The below figure presents the problem in a clear picture: e1 JX1 Assembly Line1 Engine fitting Painting Body fitting S1,2 S1,1 S1,3 e2 Eingine X2 Assembly Line2 fitting t2,2 Body fitting S2,2 Painting S2,3 S2,1 Note: Read exactly the values stated below (of a1.n; az,n; e1,e2, x1, x2, t1,1-1;t2,n-1) in the same order from the user and the display the minimum time. Example Input: number of stations (n) = 4 a[2][4] = {{4, 5, 3, 2), (2, 10, 1, 4}}; t[2][3] = {{7, 4, 5}, {9, 2, 8}}; e[2] = {10, 12); x[2] = {18, 7}; 10 5 3 2 18 12 2 10 1 Output: Minimum time = 35. For example: Input Result 35 4 5 3 2 2 10 1 4 7 4 5 9 2 8 10 12 18 7
