$[2]$ For a schedule to be serializable it must:

$($a$)$ performs transactions serially

$($b$)$ not allow two transactions any type of concurrent access to the same data items

$($c$)$ produce the same result as an actual serial execution

$($d$)$ lock the data items required by each transaction

$($e$)$ none of the above