$($e$)$ Consider the schedule of three transactions shown in Table $3.$

$($i$)$ Draw the precedence graph for this schedule.

$($ii$)$ Is the schedule conflict$-$serializable? Use your graph to justify your answer.