Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$.
Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, like, $T^{1}$ writes a value of $X$ that is read by $T^{2}$
$T^{2}$ writes a value of X that is read by $T^{3}$
$T_{n-1}$writes a value of X that is read by $T^{n}$
Now, if $T_1$ fails then total number of transaction rollbacks are required to recover the schedule is ?
- $0$
- $\left ( n \right )$
- $1$
- $\left ( n-1 \right )$