In this Question , it is said that S is serializable….. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to get a serial schedule, but what if the graph is not conflict serializable and is view serializable, then the precedence graph will be cyclic and we cannot use topological sort to get a serial schedule …….. then how come the answer is (A). Topological sort….. Please Help!!