1. Deadlock Prevention a. Describe a real-life deadlock situation in traffic management. Explain why it satisfies the four necessary conditions (mutual exclusion, hold-and-wait, non-preemption, circular wait). How do people recover from that situation? Upon recovery, which condition becomes false? b. Give a real life example (better related to the example you gave for a) of a starvation situation and show how it differs from the deadlock in a C. Give an example, where the system is not in a safe state, but if the processes of the system are allowed to be executed, then they will be successfully completed, d. Consider the classic dining philosophers problem, give a specific example that demonstrates that imposing no "Hold and Wait" on the philosophers chopsticks avoids deadlocks. With this solution, how many philosophers are able to eat at the same time