Jump to level $1$

With approach $2,$ a process must release all currently held resources prior to making any new request. Compared

to approach $1,$ approach $2$ decreases the time when resources are unavailable but at the expense of additional

release and request operations.

The table below shows when each resource is first needed $($start$)$ and when each resource may be released $($end$).$

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

approach $1$:

approach $2$: