Answer the following question as briefly as possible:

a$.$ We have four transactions each with some operations. All possible schedules that we can make out of these transactions, with or without interleaving, are always Strict. What could possibly be the reason for that?

$[1$ Mark$]$

b$.$ Using two arbitrary transactions only, give the example of a schedule with interleaving which is Recoverable but not Cascadeless. Explain your answer properly.

$[2$ Marks$]$

c$.$ Using two arbitrary transactions only, give the example of a schedule with interleaving which is Cascadeless but not Strict. Explain your answer properly.

$[2$ Marks$]$

d$.$ Is race condition possible in Recoverable schedules? Explain properly with the help of a suitable example.

$[2$ Marks$]$