Given the lock requests in the table below and the following wait$-$for graphs, mark all the

correct answers.

In the wait$-$for graphs, T$1->$ T$2$ because of A means that T$1$ is waiting for T$2$ to release the

lock on resource A$.$

The wait$-$for graph that corresponds to the given lock request is ii$).$

There is at least one deadlock in the given lock request.

There is no deadlock in the given request lock.

The wait$-$for graph that corresponds to the given lock request is i$).$