Whether the given schedule is serializable or not?
The given schedule is clearly not conflict serializable as precedence graph contains cycle..
But will it be view serializable or not??
For View Equivalence:
(1) If transaction Ti reads initial value of any data item X in one schedule it must do the same in all the equivalent schedules.
(2) If transaction Ti writes the final value of any data item X in one schedule, it must do the same in all the view-equivalent schedules.
(3) If transaction Ti reads data item X written by transaction Tj, it must do the same in all the view equivalent schedules.
And if we compare given schedule with T1-T3-T2 schedule all conditions getting satisfied.. (if you got any violation then let me know)
But the given answer says it is not view serializable..