$1.$ A schedule with exactly one transaction is always conflict$-$equivalent to a serial schedule.

True

False

$2.$ If each of the transactions in a schedule preserve the database's consistency, then every serializable schedule of those transactions also preserves consistency.

True

False

$3.$ A schedule is conflict serializable if and only if its dependency graph is acyclic.

True

False

$4.$ All schedules that avoid cascading aborts are recoverable.

True

False

$5.$ All schedules that avoid cascading aborts are conflict$-$serializable.

True

False