A daycare has $n$ children and $m$ employees. Each child i requires Wi day $-$ care

workers to keep them out of trouble. Each day $-$ care worker j can only handle children

in some subset $Sj,$ and finds the rest completely intolerable. Employee $j$ can handle at

most Kj children at once.

Besides, each child needs at least three

employees watching them at all times. Moreover, each of the workers is an expert in

exactly one of three specialties $($call the specialties A$,$ B$,$ C$).$ Determine if there is a way

to assign each child a specialist in each of the three areas, subject to the constraints. Is this

problem solvable in Polynomial run $-$ time? How? Give the algorithm to solve it$.$