A university hosts a career fair in a convention centre. The admission unit wants to recruit student helpers to assist with n talks hosted across the venue. Since the talks are hosted in halls of different sizes, and the durations vary, the number of student helpers needed for each talk is different. The admission unit wants to find out the minimum number of student helpers to be recruited. For a valid assignment plan, the following requirements have to be satisfied The answer is somewhat related to max flow, not greedy algorithm.

(4 points) A university hosts a career fair in a convention centre. The admission unit wants to recruit student helpers to assist with n talks hosted across the venue. Since the talks are hosted in halls of different sizes, and the durations vary, the number of student helpers needed for each talk is different. The admission unit wants to find out the minimum number of student helpers to be recruited. For a valid assignment plan, the following requirements have to be satisfied: - A student helper assigned to a talk has to stay for the whole duration of the talk; - After every assigned talk, a 15-minute break is given to the student helper. Give an efficient algorithm that determines the minimum number of student helpers needed. As input, for the i-th talk (i=1,,n), the algorithm receives the starting time si, the ending time ei, and the number of student helpers required for that talk mi