NOT PYTHON, show me the linear program

Q.) A company has 5 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 . Suppose the job 4 can't be processed until job 3 has been completed. 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 tardiness 2. Minimize the maximum lateness 3. Minimize the maximum completion time. 4. Minimize the maximum makespan. 5. Minimize the maximum makespan if jobs 2,3 , and 4 will be ready for processing at day 5, ? ; and 17 resnectively