$4.$ Consider schedules S $3$ below. Determine whether the schedule is a$)$ strict, b$)$ cascadeless, c$)$ recoverable, or nonrecoverable and d$)$ serializable

S$3$: r$1($x$)$; r$2($z$)$; r$1($z$)$; r$3($x$)$; r$3($y$)$; w$1($x$)$; c$1$; w$3($y$)$; c$3$; r$2($y$)$; w$2($z$)$; w$2($y$)$;c$2$