Problem 1 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: (a) Write down a mixed-integer linear programming optimization problem to find the processing schedule that minimizes the time at which all three jobs have finished. Be clear about what your variables represent. (b) Draw a diagram (Gantt chart) that shows which jobs are run when on which machine