Please check the solution:
Draw the precedence graph:
1 -- 2 -- 3--4--5--6 comes out to be order of dependency. So, only one conflict equivalent schedule possible.
Total schedules possible with 6 transactions = 6!
So 6! -1 are not conflict equivalent with given graph.