Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery.

Which of the following statements is/are correct?

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?

Suppose a database schedule $$S$$ involves transactions $${T_1},\,...,\,{T_n}.$$ Construct the precedence graph of $$S$$ with vertices representing the transactions and edges representing the conflicts. If $$S$$ is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?