Recall that a set of processes is deadlocked if every process in that set is blocked waiting for some action that can only be done by some other process in that set. For each set of conditions discussed below, is automatic deadlock detection possible? If yes, how? In this case, don't give an algorithm, but give enough detail that you can convert the problem to one where there are known algorithms that solve the problem. If no, why not?

a) All memory is shared between all processes, with processes using semaphores for mutual exclusion and synchronization.

b) Memory is not shared. Interprocess communication is through shared files, with the Unix/Linux flock kernel call being used for mutual exclusion and synchronization. Ignore the LOCK_NB option that allows for non-blocking operations (polling), so locks have only 3 states: unlocked, shared or exclusive.