Please provide a solution in java that's simple and explain all of the steps, thank you!

Given an array of jobs where every job has a deadline and associated profit if the job is finished before the deadline. It is also given that every job takes the single unit of time, so the minimum possible deadline for any job is 1. How to maximize total profit if only one job can be scheduled at a time. Examples: Input: Four Jobs with following deadlines and profits JODID Deadline Profit a 4 20 b 1 10 1 40 d 1 30 Output: Following is maximum profit sequence of jobs