Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. II. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable schedules that are not conflict serializable. Which of the above statements is/are TRUE?

Statement I is TRUE: Strict Two-Phase Locking (Strict 2PL) guarantees that all exclusive (write) locks held by a transaction are retained until the transaction commits or aborts. Because it follows the 2PL locking discipline, it ensures conflict serializability. Additionally, by holding exclusive locks until the end of the transaction, it prevents dirty reads, ensuring strict schedules, which are a proper subset of recoverable schedules (and cascade-free schedules).

Statement II is TRUE: Thomas' Write Rule modifies the basic timestamp-ordering protocol by simply ignoring obsolete write operations (blind writes) rather than rejecting them. This allows schedules that are view serializable (as the final state of the database matches a serial schedule) even if they contain conflict cycles that violate conflict serializability.

Therefore, both statements I and II are TRUE, making (C) the correct option.