Write an algorithm in pseudocode to solve the given problem and declare the input and ouput parameters(ASAP).

We hire workers for work. The work can last for N days and should be done in K number of places.

We know how many workers each place requires (place[1..K]). Work can be organized in each garden for only one day. (Of course, work can take place on different days from place to place.)

We also know at which interval of day N (refers to a day) worker M (refers to a worker) (StartDay[1..M].. EndDay[1..M]) is willing to work.

Which places can be finished with the workers? (If more than one solution is possible, you can specify either. You don't expect to select as many places as possible.)

York kind help is much appreciated.