PLEASE HELP. PLEASE! I HAVE 1 HOUR. PLEASE HELP! SCHEDULING AND SEQUENCE !

Q6-b) Consider Jm// Cmax problem with following data. a) Formulate the problem as a mixed integer programming formulation based on the disjunctive graph (use variables yij as the start time of job j on machine i, and variables zk for disjunctive either-or constraints for each disjunctive arc pairs). (7p) b) Suppose that the optimal solution obtained by the solving of the model is that y11=0, y31=0,y22=5,y32=0,y13=3,y23=0,z1=0,z2=1, and z3=0 ). Find the optimal makespan. (5p)