Can Conflict Serializable Contain Cycle?

Can Conflict Serializable Contain Cycle? A schedule S is conflict-serializable iff: The corresponding precedence graph of schedule S does not contain any cycles. How many number of conflict serializable schedules are possible for the below schedule s? Clearly, there exists a cycle in the precedence graph. Therefore, the given schedule S is not conflict serializable.