Consider a system consisting of four resources of the same type (i.e., four instances of one type of resource) that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free