Can Someone help me in this database programming question?

Consider the following schedule. S1, containing eight transactions, where R and W represent read and write operations, respectively. Construct a precedence graph for the schedule S1. With reference to the precedence graph, state the reasons why you consider schedule S1 to be or not to be conflict serializable. 12 T3 14 T5 16 17 TS R(b) R(z) RG) R(z) W(h) W(g) W(x) WG) W(x) W(g) WG) R(g) R(h) W(z) W(g)