Q2) A construction project manager needs to solve the following Team Scheduling Problem. To complete the project, a set of n tasks, denoted t1,t2,tn must be executed. Each task ti requires a set of skills to complete. If we denote by S the total set of skills, then each task ti requires a subset TSiS of skills to execute. The company also has a set of m workers, denoted w1,w2,wm. Each worker wj possesses a set WSjS of skills. The manager would like to know if it is possible to select a team of k workers who can complete the project. A task can be completed by several cooperating workers, as long as every skill required for the task is covered by at least one of the cooperating workers. However, no worker on the team is allowed to work at more that tasks. Prove that the Team Scheduling Problem is NP-complete using a reduction to Set Cover. You can use the fact that Set Cover is NP-complete. Example: suppose we have a set of 4 skills {a,b,c,d}, a project consisting of 4 tasks, and 6 workers. The task requirements and worker skill sets are given by the following table, where an ' x ' indicates that the worker (task) possesses (requires) the corresponding skill. If =2 and k=3, then the answer is YES. A certificate is the following: worker 1 allocated to tasks 1 and 2 , worker 2 assigned to tasks 2 and 3 , and worker 5 assigned to task 4