Prove that strict two-phase locking guarantees strict schedules.

What will be an ideal response?

Since no other transaction can read or write an item written by a transaction T until T
has committed, the condition for a strict schedule is satisfied.