1. Modify the preceding exercise by considering a system with different instances of physical resources (CPUs, disks, etc.), but in which programs may share some files. Is the model used in the previous case still adequate? Why? 2. Show that any FSM can be “translated” into an equivalent PN—that is, a PN whose set of acceptable firing sequences is the same as the transition sequences of the FSM. Also, show that the converse operation is not always possible. How can you analyze the deadlock-freedom property by means of FSMs?