Consider the following scenario: A, B, C, D are processes and X, Y are resources used by the processes.
| Process | has-X | has-Y | max-needs-X | max-needs-Y |
| A | 35 | 10 | 65 | 40 |
| B | 55 | 80 | 105 | 220 |
| C | 35 | 20 | 110 | 50 |
| D | 0 | 70 | 50 | 90 |
If Resources available: [X: 40 Y: 40] then what will be a safe sequence so that the processes complete execution without deadlock?
1
ACDB
2
ADCB
3
Both (1) and (2)
4
ABDC