DBMS-locks

Question

Are these stmts true

1. A conflict serialisable schedule is recoverable but may not be cascadeless
2. Schedules allowed under 2pl are necessarily recoverable and conflict serialisable
3. Strict and rigorous 2 pl guarantee recoverable and cascadeless behaviour.
4. Both of them suffers from deadlock and starvation.
5. Timestamp model doesnt suffer from deadlock but suffers from starvation