I mainly need help solving the first part of this problem because i cant even attempt the following parts without getting that correct, but AMPL code to actual generate an answer would be greatly appreciated

Recall the job shop scheduling example from class. Now a new set of jobs arrived at Fancy Furnishing's, with the following sequences and processing times: Processing Time Job Sequence AB 1 A-C-B 4 5 12 2 B-A-C 6 18 3 3 C-B-A 5 7 3 (a) Write down a mixed-integer linear programming problem to find the processing schedule that minimizes the time at which all three jobs have finished. As usual, be clear about what your variables represent. (b) Solve this problem with AMPL. Make sure you submit the usual APL files as desctribed in previous assignments. (c) In your written assignment, draw a diagram (Gantt chart) that shows which jobs are run when on which machine. Recall the job shop scheduling example from class. Now a new set of jobs arrived at Fancy Furnishing's, with the following sequences and processing times: Processing Time Job Sequence AB 1 A-C-B 4 5 12 2 B-A-C 6 18 3 3 C-B-A 5 7 3 (a) Write down a mixed-integer linear programming problem to find the processing schedule that minimizes the time at which all three jobs have finished. As usual, be clear about what your variables represent. (b) Solve this problem with AMPL. Make sure you submit the usual APL files as desctribed in previous assignments. (c) In your written assignment, draw a diagram (Gantt chart) that shows which jobs are run when on which machine