As we discussed in this chapter, a system that is in an unsafe state is not necessarily deadlocked. Explain why this is true. Give an example of such a system $($in an unsafe state$),$ and describe how all the processes could be completed without causing a deadlock to occur.

Consider a banking system with ten accounts. Funds may be transferred between two of those accounts by following these steps:$$

a$.$ Can this system become deadlocked? If yes, show how. If no$,$ explain why not.$$

b$.$ Could the numbering request policy $($presented in the chapter$5$ discussion about detection$)$ be implemented to prevent deadlock if the number of accounts is dynamic? Explain why or why not.