Problem:
Question 1- Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock- free.
Question 2- Describe resourse allocation graph.
Please do not provide cut and paste answers and please include a source.