The following represents the sequence of events in a schedule involving transactions T1, T2, T3, T4 and T5. A,B, C, D, E, F are items in the database.
|
12
|
:
|
Read
|
B
|
|
T4
|
:
|
Read
|
D
|
|
12
|
:
|
Read
|
E
|
|
12
|
:
|
Write
|
E
|
|
T3
|
:
|
Read
|
F
|
|
12
|
:
|
Read
|
F
|
|
T1
|
:
|
Read
|
C
|
|
T5
|
:
|
Read
|
A
|
|
T5
|
:
|
Write
|
A
|
|
T1
|
:
|
Read
|
E
|
|
T5
|
:
|
Read
|
C
|
|
T3
|
:
|
Read
|
A
|
|
T5
|
:
|
Write
|
C
|
|
12
|
:
|
Write
|
F
|
|
T4
|
→. |
Read
|
A
|
Draw a wait-for-graph for the data above and find whether the transactions are in a deadlock or not?