10. Write a program employing dynamic programming strategy to implement each of the following problems. Assembly line scheduling problem. A car factory has two assembly lines, cach with n stations. A station is denoted by S., where i is either 1 or 2 and indicates the assembly line the station is on, and j indicates 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 chassismust pass through each of the n stations in order before exiting the factory. The parallel stations of the two assembly lines perform the sametask. After it passes through station Sj, it will continue to station Sunless it decides to transfer to the other line. Continuing on the same line incurs no extra cost, but transferring from line i at station i 1 to station j on the other line takes time tj. Each assembly line takes an entry time e, and exit time x which may be different for the two lines. Give an algorithm for computing the minimumtime it will take to build a car chassis. The below figure presents the problem in a clear picture: el X1 Assembly Line1 Engine fitting Painting Body fitting 11,2 7 S1,2 S1,1 S1,3 t2,2 X2 e2 Assembly Line2 Painting Eingine fitting S2,0 Body fitting $2,2 $2,3 Get the values of al,n; a2,n; el, c2, x1, x2, tl,n-1; 12,n-1 from the user andthe display the minimum time. Example Input: a[2][4] = {{4, 5,3,2), (2, 10, 1,4}}; t[2][3] = {{7,4,5}, {9, 2,8}}; c[2] = {10, 12); X[2] = {18, 7): = 10 18 12 10 7 Output: Minimum time = 35. Print the line also