For each 1 <= i<= njob jiis given by two numbers diandpi, where diis the deadline and piis the penalty. The length of each job is equal to 1 minuteand once the job starts it cannot be stopped until completed. We want to schedule all jobs, but only one job can run at any given time. If job i does not complete on orbefore its deadline, we willpay its penalty pi. a)Design a greedy algorithm to find a schedule such that all jobs are completed and the sum of all penaltiesis minimized. Provide averbal description and pseudocode. b)What is the running time of your algorithm?