Problem $3.$ Resource Reservation.

Suppose you are consulting for a group that manages a high$-$performance real$-$time system in which asynchronous processes make use of shared resources. Thus the system has a set of n processes and a set of m resources. At any given point in time, each process specifies a set of resources that it requests to use. Each resource might be requested by many processes at once; but it can only be used by a single process at a time. Your job is to allocate resources to processes that request them. If a process is allocated all the resources it requests, then it is active; otherwise it is blocked.

The Resource Reservation Problem is phrased as follows: Given a set of processes and resources, the set of requested resources for each process, and a number k$,$ is it possible to allocate resources to processes so that at least k processes will be active?

Reduce the Independent Set Problem to the Resource Reservation Problem, and state why your reduction is correct.