Solution in Java. Efficient solution please. int start_time: when you plan to start your schedule int end_time: when you plan to end your schedule int j_starts[n]: the start times of each job[i] int j_ends[n]: the end times of each job[i] int j_pays[n]: the pay for each job[i] Return the maximum amount of money possible to be made with non overlapping jobs.

Test start_time = 0 end_time = 10 j_starts = [2, 3, 5, 7] j_ends = [6, 5, 10, 11] j_pays = [5, 2, 4, 1] Expected output: 2+4 = 6

Constraints end_time >= start_time j_ends[i] >= j_starts[i] j_pays[i] > 0 j_starts.length == j_ends.length == j_pays.length