Write a C program

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 Sij 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 aij. 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 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 j 1 to station j on the other line takes time tij. Each assembly line takes an entry time ei 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: Note : Read exactly the values stated below (of a1,n;a2,n; e1, e2, x1,x2,t1,n1;t2,n1 ) 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} Output: Minimum time =35. For example