Assume an operation p has a compensating operation p?1. Showthat if operation q commutes with p, then p?1 commutes with q.

What will be an ideal response?

Since q commutes with p, the schedule p, q, p?1 is equivalent to the schedule
q, p, p?1. But starting in all initial states, this schedule leaves the database in the
same final state as the schedule p, p?1, q, which implies that p?1 commutes with q.