A cycle is present in a resource allocation graph for a system with three processes and the following resources: one printer, two memory buffers, and one punched card reader. Is the system deadlocked? No Yes Can't say with certainty. A cycle in the graph means the system is deadlocked. Would making a philosopher in the Dining Philosophers problem give up a chopstick when he can't get the second one avoid deadlock and starvation? avoid deadlock, avoid starvation avoid deadlock, starvation still possible deadlock still possible, starvation still possible deadlock still possible, avoid starvation