This questions is about network flow from computer science 2 and part c is greedy solution. Please show work and explain.

We have a set of students from the same class that wants to discuss their exam grades with their teacher. The teacher does not want to meet with more than one student at a time to prevent giving the grade information of the student to others. The teacher is very experienced and can finish each discussion in exactly 10 minutes. Each student has one given block of time (in multiples of 10 minutes) which they can meet with teacher. The teacher is trying to find the maximum number of students they can meet with a) How would this be solved by flow? b) Draw the flow graph that would help solve the problem for the following student descriptions Name Steve John Matt Jamie Paul Start time 5:10 5:00 5:00 5:10 5:10 End time 5:30 5:30 5:20 5:30 5:40 c) Describe a Greedy solution for this problem, which runs in O(n log(n)), where n is the number of students We have a set of students from the same class that wants to discuss their exam grades with their teacher. The teacher does not want to meet with more than one student at a time to prevent giving the grade information of the student to others. The teacher is very experienced and can finish each discussion in exactly 10 minutes. Each student has one given block of time (in multiples of 10 minutes) which they can meet with teacher. The teacher is trying to find the maximum number of students they can meet with a) How would this be solved by flow? b) Draw the flow graph that would help solve the problem for the following student descriptions Name Steve John Matt Jamie Paul Start time 5:10 5:00 5:00 5:10 5:10 End time 5:30 5:30 5:20 5:30 5:40 c) Describe a Greedy solution for this problem, which runs in O(n log(n)), where n is the number of students