... Programminga1,1e1entere2a2,1a1,2a2,2t1,1t2,1t1,2t2,2a1,3a2,3t1,3t2,3a1,4a2,4t1,4t2,4a1,5a2,5x1x2exitS1,1S2,1S1,2S2,2S1,3S2,3S1,4S2,4S1,5S2,5247822931534831322 64 5 6 Automobile factory with two assembly lines.•Each line has n stations: S1,1, ,S1,nand S2,1, ... through S1, j −1.15-24 Solutions for Chapter 15: Dynamic Programmingon page 365 , we wish to print the sequence p7, p 6 , p4, p3, p1, p2, p5. Our code isrecursive. The right-to-left ... further. We determine in what orderwe’d want to access the table, and Þll it in that way.15- 26 Solutions for Chapter 15: Dynamic ProgrammingPRINT-NEATLY(l, n, M)✄ Compute extras[i, j ] for...