Given n courses labeled from 1 to n and an array of prerequisite pairs relations where relations[i] = [prevCourse, nextCourse] indicates that prevCourse must be taken before nextCourse.

In one semester, you can take at most k courses. Find the minimum number of semesters needed to take all courses.