Max flow There are n undergraduate students and k departments at some university. The Student Senate must have k students, one from each department. It also should have k1 freshmen, k2 sophomores, k3 juniors, and k4 seniors where k1 + k2 + k3 + k4 = k. The task is to decide if the Student Senate can be formed. If it can be formed, find a solution with k students. Design an algorithm for this task using max flow.