ANSWER WITHIN 2 HOURS PLZ

(a) Produce the process in Greedy Algorithm to get the optimal sequence for Table 3

One of the objectives of Greedy Algorithm is to find feasible solution in an optimization problem, for example, a problem in finding jobs sequence. Table 3 provides a list of jobs depicted by J1 until J9 that have constraints. The constraints are deadlines and profits. In this problem, the aim is to find an optimum sequence of jobs that fulfill the constraints, which is completed within their deadlines and gives maximum profit. Note that the deadlines indicate length of period in week to complete the respective task. For example, J1 must be completed in 5 weeks. To achieve this aim, use Greedy Algorithm method by answering the following questions: Table 3 Jobs J1 J2 J3 J4 J5 J6 J7 JS J9 Deadlines 5 2 2 5 3 7 3 4 7 Profits 10 19 22 35 17 16 26 17 18