Assume there are three resources, R1, R2, and R3, that are each assigned unique integer values 15, 10, and 25, respectively. What is a resource ordering which prevents a circular wait?
A) R1, R2, R3
B) R3, R2, R1
C) R3, R1, R2
D) R2, R1, R3
3rd Edition•ISBN: 9780262033848 (2 more)Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen 5th Edition•ISBN: 9781118898208Jack T. Marchewka 7th Edition•ISBN: 9780133970777 (1 more)Ramez Elmasri, Shamkant B. Navathe 5th Edition•ISBN: 9780124077263 (5 more)David A. Patterson, John L. Hennessy