Consider the given schedule having $5$ transactions $($indicated by subscript of operations$)$

R$2($X$),$R$1($Y$),$R$1($Z$),$R$5($V$),$R$5($W$),$R$5($W$),$R$2($Y$),$W$2($Y$),$W$3($Z$),$R$1($U$),$R$4($Y$),$W$4($Y$),$R$4($Z$),$W$4($Z$),$R$1($U$),$W$1($U$)$

a$)$If it is serializable, then find all the possible patterns to convert it into a serializable schedule.Also Comment whether the given schedule is conflict serializable or view serializable.

b$)$Since every conflict serializable schedule is view serializable, why do we emphasis conflict serilizability rather than view serilizability.