Consider the following statements about database transaction schedules:
Which of the below statements is/are TRUE?
1
Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable.
2
Two Phase locking ensure freedom from deadlock freedom.
3
Timestamp ordering ensures both deadlock freedom and conflict serializability
4
Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable