A' is set of all possible schedules
'C' is set of all possible schedules that are guaranteed to produce a correct final result
'S' is the set of all serializable schedules
'P' is the set of all schedules possible under 2-phase locking protocol
Which is FALSE?
- $P\subseteq C$
- $S\subset P$
- $S\subseteq P$
- $P\subset C$