Ouestion $3(15$ points$)$

Consider the following transaction schedules. For each of the following transaction schedules, indicate if it is

conflict serializable or not. Draw the precedence graph for each case; then point out a cycle $($if one exists$)$ or an

equivalent serial schedule $($if one exists$).$

a$.$

b$.$