$\backslash$begin$\{$tabular$\}\{|$c$|$c$|$c$|$c$|$c$|$c$|$c$|\}$

$\backslash$hline $\backslash$multirow$[$t$]\{14\}\{*\}\{3.\}$ & $\backslash$multicolumn$\{5\}\{|$l$|\}\{\backslash$begin$\{$tabular$\}\{$l$\}$

a$)$ How many serial schedules are possible for $\backslash ($ n $\backslash )$ transactions? $\backslash \backslash$

b$)$ Find out whether the following schedule is conflict serializable or not. If it is conflict serializable, show all possible serial schedule$($s$).$

$\backslash$end$\{$tabular$\}\}$ & $\backslash [$

$2$

$\backslash ]\backslash \backslash$

$\backslash$hline & & T$1$ & T$2$ & T$3$ & T$4$ & $\backslash \backslash$

$\backslash$hline & & $\backslash (\backslash$operatorname$\{$read$\}(\backslash$mathrm$\{$A$\})\backslash )$ & & & & $\backslash \backslash$

$\backslash$hline & & read$($B$)$ & & & & $\backslash \backslash$

$\backslash$hline & & & read$($B$)$ & & & $\backslash \backslash$

$\backslash$hline & & write$($A$)$ & & & & $\backslash \backslash$

$\backslash$hline & & & & & read$($C$)$ & $\backslash \backslash$

$\backslash$hline & & & & $\backslash (\backslash$operatorname$\{$read$\}(\backslash$mathrm$\{$A$\})\backslash )$ & & $\backslash \backslash$

$\backslash$hline & & & & write$($A$)$ & & $\backslash \backslash$

$\backslash$hline & & & write$($B$)$ & & & $\backslash \backslash$

$\backslash$hline & & & & & write$($C$)$ & $\backslash \backslash$

$\backslash$hline & & Write$($C$)$ & & & & $\backslash \backslash$

$\backslash$hline & & & & write$($B$)$ & & $\backslash \backslash$

$\backslash$hline & & $\backslash (\backslash$operatorname$\{$read$\}(\backslash$mathrm$\{$C$\})\backslash )$ & & & & $\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$