Consider the following schedule:
$\begin{array}{|l|l|} \hline T1 & T2 \\ \hline {} & \text{Read (A)} \\ \hline {} & A = A + 10 \\ \hline {} & \text{ Read (B)} \\ \hline {} & A =B +10 \\ \hline {} & \text{Write (A)} \\ \hline \text{Read (B)} & {} \\ \hline B = B+ 10 & {} \\ \hline \text{Read (A)} & {} \\ \hline B = A+ 10 \\ \hline \text{write (B)} & {} \\ \hline \text{commit} & {} \\ \hline {} & \text{commit} \\ \hline \end{array}$
Which of the following transaction problems is present in the given schedule ?
- Lost update
- Dirty Rea
- Unrepeatable read
- Both (A) & (B)