Consider a deadlock detection scheme for a single server. Describe precisely when edges are added to and removed from the wait-for-graph. Illustrate your answer with respect to the following transactions T, U and V at the server:
\begin{tabular}{l|l|l}
\hline T & \( \mathrm{U} \) & \( \mathrm{V} \) \\
\hline Write(i, 55) & Write(i, 66) & \\
& & Write(i,
When U releases its write lock on ai, both T and V are waiting to obtain write locks on it. Does your scheme work correctly if T (first come) is granted the lock before V? If your answer is ‘No’, then modify your description.
