Use maximum-flow to describe a polynomial-time algorithm that implements the scheduling system!!!

Describe the algorithm. Analyze the RT in terms of n and k.

We have the following scheduling problem. For each of the next n days, the hospital has determined the number of doctors they want on hand; thus, on day i, they have a requirement that exactly p; doctors be present. There are k doctors, and each is asked to provide a list of days on which s/he is willing to work. Thus doctor j provides a set L; of days s/he is willing to work. The scheduling system takes these lists and tries to return to each doctor j a list L;' with the following properties: (1) L'is a subset of Lj, so that doctor jonly works on days s/he finds acceptable (2) The set of lists L1, L2, ..., LK' causes exactly p; doctors to be present on each day i, for i = 1, 2, ..., n. Use maximum-flow to describe a polynomial-time algorithm that implements the scheduling system. More specifically, the algorithm takes as input:n, k, the numbers p1, ..., Pn, the lists L1, L2, ...Lk, and produces the following output: returns the lists L1, L2, ..., Lk'if a schedule satisfying properties (1) and (2) is possible otherwise reports that there is no possible schedule. Describe the algorithm. Analyze the RT in terms of n and k. We have the following scheduling problem. For each of the next n days, the hospital has determined the number of doctors they want on hand; thus, on day i, they have a requirement that exactly p; doctors be present. There are k doctors, and each is asked to provide a list of days on which s/he is willing to work. Thus doctor j provides a set L; of days s/he is willing to work. The scheduling system takes these lists and tries to return to each doctor j a list L;' with the following properties: (1) L'is a subset of Lj, so that doctor jonly works on days s/he finds acceptable (2) The set of lists L1, L2, ..., LK' causes exactly p; doctors to be present on each day i, for i = 1, 2, ..., n. Use maximum-flow to describe a polynomial-time algorithm that implements the scheduling system. More specifically, the algorithm takes as input:n, k, the numbers p1, ..., Pn, the lists L1, L2, ...Lk, and produces the following output: returns the lists L1, L2, ..., Lk'if a schedule satisfying properties (1) and (2) is possible otherwise reports that there is no possible schedule. Describe the algorithm. Analyze the RT in terms of n and k