introduction to operating system

Suppose there are three Processes A1, A2and A3. There are two instances of Resource R1 and one instance of R2. A1 holds Resource R1 and requesting for Resource R2. A2 holds Resource R2 and requesting for Resource R1. . A3 holds Resource R1. Consider the scenario in terms of Deadlocks. You may consider drawing a Resource Allocation Graph for the above scenario. a) What kind of situation does the graph show (Deadlock or No Deadlock)? b) Justify your answer to question (a)