Conditions for view equal:
Initial Read : -
Updated Read: 1>2,3>4,5>6,7>8,9>10
Final write : 9
So 9>10 transaction order is at the final ,with the other 4 precedences permutations.
Total permutations of 1>2,3>4,5>6,7>8 = 4! = 24 ways ( including the one given in the question)
We can observe that since every transaction is conflicting with every adjacent transaction , no other schedule is conflict equivalent.
So total number of view equal schedules to above and not conflict equivalent = 23