Let a and b be two data items of the database. Suppose that the system clock is $0,$ and that the system uses the clock values as the timestamps to be assigned to the various transactions $($at their first action$).$ Illustrate the actions of the timestamp$-$based scheduler when receiving the following complete schedule:

r$1($a$)$ r$2($b$)$ r$3($a$)$ r$2($a$)$ w$1($a$)$ w$3($a$)$

$-$ whether the resulting sequence of actions $($obtained by ignoring aborted transactions$)$ is a strict $2$PL schedule.