Problem
We consider the example about two threads accessing a printer and a plotter. We consider the case that at Position T no deadlock avoidance is applied and then the system will enters the red-bordered state. Draw the Resource Allocation Graphs (RAG) at the following time spots:
a) Right before the system enters the red-bordered state.
b) Right after the system enters the red-bordered state.