For each of the following transaction schedules, draw the dependency graph and decide if the schedule is conflict-serializable. If the schedule is conflict-serializable, give an equivalent serial schedule by listing the serial order of transactions. If the schedule is not conflict-serializable, explain why