For the system described below, given that all of the devices are of the same type, and using the definitions presented in the discussion of the Banker’s Algorithm, answer these questions:

- Calculate the number of available devices.
- Determine the remaining needs for each job in each system.
- Determine whether each system is safe or unsafe.
- If the system is in a safe state, list the sequence of requests and releases that will make it possible for all processes to run to completion.
- If the system is in an unsafe state, show how it’s possible for deadlock to occur.

This system has 14 devices.

Job No |
Devices Allocated |
Maximum Required |
Remaining Needs |

1 | 2 | 6 | |

2 | 4 | 7 | |

3 | 5 | 6 | |

4 | 0 | 2 | |

5 | 2 | 4 |