Do the following please.

Consider three processes with two types of resources allocated to them.

Each process's maximum needs are also known.

The following resources are available.

Starting from this state, use the banker's algorithm to determine whether the following requests

should be accepted or rejected. Show your work.

Process P$1$ requests $1$ of resource $1.$

Process P$2$ requests $1$ of resource $2.$