Q$2.$ Consider the following data

$T=\{T_1,T_2,T_3,T_4,T_5,T_6,T_7,T_8,T_9,T_{10},T_{11}\},R=\{R_1,R_2,R_3,R_4,R_5,R_6,R_7,R_8,R_9,R_{10}\}$&

$E=\{\begin{array}{c}{R}_3{T}_1\\ T_{3}longrightarrow{R}_3\\ R_{1}longrightarrow{T}_5\\ T_{1}longrightarrow{R}_7\\ T_{11}longrightarrow{R}_2\\ T_{9}longrightarrow{R}_4\\ R_{4}longrightarrow{T}_1\\ R_7{T}_7\\ T_{10}longrightarrow{R}_1\\ ?\end{array}$

$T_7{R}_2,T_{7}longrightarrow{R}_8,R_{8}longrightarrow{T}_9,T_{9}longrightarrow{R}_9,T_{9}longrightarrow{R}_1,R_3{T}_1,T_{3}longrightarrow{R}_3,R_{1}longrightarrow{T}_5,T_5{R}_5,$

$T_{10}{R}_5,R_{5}longrightarrow{T}_3,R_{10}{T}_5,R_{10}longrightarrow{T}_8,T_{11}longrightarrow{R}_{10},R_6{T}_8,R_{6}longrightarrow{T}_4,R_{2}longrightarrow{T}_4,R_{2}longrightarrow{T}_2,$

$\{$:$R_{2}longrightarrow{T}_6,R_{9}longrightarrow{T}_3,R_{2}longrightarrow{T}_6,T_{7}longrightarrow{R}_8,T_{11}longrightarrow{R}_2,T_{9}longrightarrow{R}_4,R_{4}longrightarrow{T}_1\}$

$(Note$: Each Resource contain only one instance$).$

Draw the

a$)$ Resource allocation graph?

b$)$ Wait for Graph and find whether there is any dead lock in the above graph, if yes then mentioned?

c$)$ Recover the dead lock, if any. In addition, mention the name of method that you have used.

$($CLO$2$: S$1=15$ Marks$)$