Explain the algorithm and its complexity for solving job sequencing with deadline problem using greedy strategy.

Given n jobs, each with a deadline and a profit (earned only if the job is completed by its deadline), find a feasible sequence of jobs that maximizes total profit. Each job takes unit time to complete and only one machine (processor) is available. --- The greedy approach selects jobs in decreasi...