Plz help me in this question

You are given the following set of jobs: Job Duration Due Time 1 12 23 2 8 15 3 17 34 10 20 5 5 13 6 11 35 (i) Define the terms makespan and slack in a scheduling context. (3 m (ii) Produce a schedule using the Critical Ratio method. [3 ma iii) Produce the schedule which minimises the number of late jobs using Mo Algorithm. [4 m An investor is deciding how to invest 5 million between three different investi schemes. The table below shows the amounts that can be invested in each o three schemes, together with the expected returns. All values stated are in mil of pounds. Scheme 1 Proposal Cost Revenue 1 0 0 2 1 1 3 2 3 4 3 4 Scheme 2 Scheme 3 Cost Revenue Cost Revenue 0 0 0 2.5 1 1.5 3 4 CO NO Use dynamic programming to determine how much should be invested in scheme in order to maximise the expected return. Give all optimal solut Include all definitions in your answer. No marks will be awarded if a me other than dynamic programming is used. (15 ma You are given the following set of jobs: Job Duration Due Time 1 12 23 2 8 15 3 17 34 10 20 5 5 13 6 11 35 (i) Define the terms makespan and slack in a scheduling context. (3 m (ii) Produce a schedule using the Critical Ratio method. [3 ma iii) Produce the schedule which minimises the number of late jobs using Mo Algorithm. [4 m An investor is deciding how to invest 5 million between three different investi schemes. The table below shows the amounts that can be invested in each o three schemes, together with the expected returns. All values stated are in mil of pounds. Scheme 1 Proposal Cost Revenue 1 0 0 2 1 1 3 2 3 4 3 4 Scheme 2 Scheme 3 Cost Revenue Cost Revenue 0 0 0 2.5 1 1.5 3 4 CO NO Use dynamic programming to determine how much should be invested in scheme in order to maximise the expected return. Give all optimal solut Include all definitions in your answer. No marks will be awarded if a me other than dynamic programming is used. (15 ma