Consider a given schedule S with $3$ transactions having time stamp TS$($T$1)=2,$ TS$($T$2)=4,$ TS$($T$3)=6.$ Check whether this schedule is possible under Time Stamp Ordering protocol? S$=$ R$2($A$),$ R$3($C$),$ W$3($A$),$ W$2($A$),$ W$2($B$),$ W$3($C$),$ R$1($A$),$ R$1($B$),$ WI$($A$),$