1. For each of the following schedules, state and draw precedence graph whether the schedule is serializable or conflict-serializable and whether it avoids cascading abortsor not.
(a) read(T1, balx), read(T2, balx), write(T1, balx), write(T2, balx), commit(T1), commit(T2)
(b) read(T1, balx), read(T2, baly), write(T3, balx), read(T2, balx), read(T1, baly), commit(T1), commit(T2)
(c) read(T1, balx), write(T2, balx), write(T1, balx), abort(T2), commit(T1)
(d) write(T1, balx), read(T2, balx), write(T1, balx), commit(T2), abort(T1)
(e) read(T1, balx), write(T2, balx), write(T1, balx), read(T3, balx), commit(T1), commit(T2), commit(T3)