the following schedule is conflict-serializable. list out at least four equivalent serial schedules for this schedule. you can do this by drawing the precedence graph, and then finding sequences of transactions where all the edges go from left to right. as an example: t1, t2, t3, t4, t5 is clearly not an equivalent serial schedule because there is an edge from t3 to t1 (due to a).