If a graph can be reduced by all its processes, then ________.
a) there is no deadlock
b) indefinite postponement cannot occur
c) the system is in an unsafe state
d) none of the above
a) there is no deadlock
Computer Science & Information Technology