Max Credits with K Classes (Interval-Style)

Requirements You are given a list of classes. Each class has a start time, an end time, and a credit value. Implement: Return the greatest total credit obtainable by choosing no more than K classes, subject to these rules: A class may be selected at most once. The selected classes must not overlap in time. At most K classes can be chosen. The result is the maximum sum of the selected classes' credits. This is an interval-scheduling problem, not the course-schedule graph…