undefined

CHALLENGE ACTIVITY 5.3.1: Dynamic deadlock avoidance. Start D-D-D Two processes, p1 and p2, share two single-unit resources, r1 and r2. The resource allocation graph is represented by the following tables. 2 Maximum claims Current Current Potential allocations requests requests Available units r1 r2 r1 r2 r2 r2 r1 r2 p1 1 1 00 0 1 1 1 0 1 p2 1 1 1 0 0 1 0 1 Hint: It is useful to draw the graph using the above table. The visual image is more intuitive than the text. Can the request of p1 be granted? Select If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then select the processes that remain blocked when the request is tentatively granted. p1 p2 Can the request of p2 be granted? Select If yes, then select the processes that are unblocked when the request is tentatively granted. If no, then select the processes that remain blocked when the request is tentatively granted. p1 p2