The ordered resources policy dictates that resources must be requested in ascending order. If the order is

unknown ahead of time, then prior to requesting a resource $i,$ a process must release all resources $j>i.$

A process requests $6$ resources in the order $r2,r6,r1,r5,r3,r4.$

Determine the total number of request $+$ release operations for

approach $3,$ assuming $r3$ is not available at the time of the request:

the ordered resources policy: