$2$ A deadlock can occur when executed transactions T$1$ and T$2$ concurrently. While the transaction T$1$ is waiting for the data object B to be released by transaction T$2,$ transaction T $2$ tries to obtain the object A $,$ and it is blocked because A is already locked by transaction T$1.$

A$.$ False

B$.$ True

$3$ The schedule of transactions T$1$ and T$2$ generated by a scheduler is guaranteed to be $q,$

$$

A$.$ a serial schedule

B$.$ a strict schedule

C$.$ a conflict serializable schedule

D$.$ a cascadeless schedule

$4$ Assuming that $71$ starts first and T$2$ wants a lock that TI holds. Which transaction needs to be aborted under the wait$-$die deadlock prevention scheme? $$

$$

A$.$ TI

B$.$ T$2$

C$.$ T$1$ and T$2$

D None of the above.