A schedule is called __________ if it is conflict equivalent to a serial schedule.Conflict serializableConflictingNon serializableNone of the mentioned

A schedule S is conflict serializable if it is conflict equivalent to a _________ schedulea)serialb)recoverablec)strictd)non seriale)cascadeless

Every conflict serializable schedule is also ___________ serializable.

Every conflict serializable schedule is also ___________ serializable.TransactionConceptualViewConflictExplanation for answer

Let Ri(z) and Wi(z) denote read and write operations on a data element z by a transaction Tjr respectively. Consider the schedule S with four transactions. S: R4(x) * R2(x) * R3(x) * R1(y) * W1(y) * W2(x) * W3(y) * R4(y) Which one of the following serial schedules is conflict equivalent to S?

consider the schedule S given below.S: R1 (X), W2 (X), W1 (X),Which of the following statement is correct?S is neither view nor conflict serializable.S is view-serializable but not conflict-serializable.S is conflict serializable but not view serializable.S is both view and conflict serializable.