Concurrent Programming Subject, please help me answer those questions:

TRUE$-$FALSE $($T$/$F$)$ QUESTIONS $($please put answers in $[])$

$[]1$ If a resource allocation graph has no cycles, there will be no deadlock.

$[]2$ If a resource allocation graph contains a cycle, there will be a deadlock.

$[]3$ Reboot is considered as an option to recover from deadlocks if deadlocks are rare.