Exercise $1$

Consider a set of transactions T$1,$ T$2,$ T$3,$ T$4,$ and T$5.$

Write a schedule for the transactions using the two$-$phase locking protocol as the SGT scheduler.

Exercise $2$

Consider the following set of transactions:

T$1$: Read$($A$),$ Write$($B$)$

T$2$: Read$($B$),$ Write$($C$)$

T$3$: Read$($C$),$ Write$($A$)$

Using the SGT scheduler, write a serializable schedule for the transactions that maintains the conflict serializability property