Job Sequencing Problem. $(10$ bonus points$)$

In this problem we have $n$ jobs $j_1,j_2,$dots,$j_n,$ each has an associated deadline $d_1,d_2,$dots,$d_n$

and profit $p_1,p_2,$dots,$p_n.$ Profit will only be awarded or earned if the job is completed before

the deadline. We assume that each job takes $1$ unit of time to complete. The objective

is to earn maximum profit when only one job can be scheduled or processed at any given

time.

Describe or provide the pseudocode of an algorithm to find the sequence of jobs to do

with the maximum total profit.

$[$Hint: You can select the jobs in a greedy way. You can use the following

example to help your analysis.$]$

The best job sequence would be $J2J1J3.$