Please use linear programming

Thanks in advance

time Problem: GJU Shop has & outstanding jobs to be processed on two machines. The following table provides processing times for each machine and the due dates. All times are in days and due time is measured from time 0. Job Processing Processing Due time on time on date M1 M2 1 10 9 20 2 3 5 98 M1 3 13 11 100 4 15 14 34 5 9 7 50 6 22 18 44 7 17 19 32 8 30 27 60 M2 Required: Define your decision variables clearly, and based on that formulate this problem as a linear programming model and solve it using PYTHON for the following cases: 1. Minimize the total and the maximum tardiness. 2. Minimize the total and the maximum lateness. 3. Minimize the average and the maximum completion time. 4. Minimize the average and the maximum makespan. 5. Minimize the maximum tardiness if jobs "3", "6", and "s" will be ready for processing at day 5,7, and 12 respectively, and if job "3" must preceded job "8." Note: You can present your results using Gantt chart