Give an example of three transactions that obey basic $2$PL and have the following property: when being executed, a deadlock involving all three transactions may occur.

What is a possible solution for the deadlock using transaction timestamps? Explain using the same schedule you have provided.

Notes:

$1-$ Transactions must access at least three shared data items.

$2-$ Schedules exhibit read$-$write and$/$or write$-$write conflicts when executed concurrently.

Notes on grading: This question will be graded based on the correct choice and explanation of the schedule $,$ the correct answer for deadlock $,$ and the quality of the answer $.$