Serial Schedule of Non Conflict Serializable Precedence Graph

My task is to find a serial schedule of a non conflict serializable precedence graph for these four transactions (T1, T2, T3, T4).

The schedule given: R1(B), R4(A), R3(A), W3(A), W4(A), R1(A), W1(B), R2(B), R4(B), W4(B), W1(A), W2(B)

I have found the precedence graph as below and determined it is non conflict serializable as it has loops. However, how do I give a serial schedule of these transactions?

Thanks!

enter image description here