Consider the following two transactions. T: W(A); W(B); r(C); C; T2: W2(A); r2(B); W2(C); C2; where w, r, and c denote a write, read, and commit instruction, respectively. a) b) c) d) How many possible schedules of T and T are there? Among all possible schedules of T and T2, list all schedules that are not recoverable. Among all possible nd T2, list all dules that are recoverable but edules of T not conflict serializable. Among all possible schedules of T and T, list all schedules that are cascadeless and conflict serializable and show their serializability orders.