Consider the following schedule of actions on the data items A$,$ B$,$ C and D$,$ listed in the order it is

submitted to the DBMS $(S$ is a shared lock, $x$ is an exclusive lock$)$:

S: T$1$:X$($A$),$ T$3$:S$($D$),$ T$3$: S$($A$),$ T$4$:X$($C$),$ T$2$:S$($B$),$ T$4$:X$($A$),$ T$2$:X$($C$),$ T$1$:X$($B$),$ T$4$:X$($D$)$

For the Schedule S$,$

a$)$ Mention for each request whether the request is granted or blocked by the lock manager.

b$)$ Show the waits$-$for graph and indicate whether there will be a deadlock or not at the end of each

sequence.