LINEAR PROGRAM FOR OPERATIONS RESEARCH IS REQUIRED

in Python software in a structured method. Question: GJU Shop has four outstanding jobs to be processed on a single machine. The following table provides processing times and due dates. All times are in days and due time is measured from time 0: Job Processing time 1 9 2 7 3 11 4 17 Due time 24 31 45 28 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 average and the maximum makespan if jobs 2, 3, and 4 will be ready for processing at day 5, 7, and 12 respectively