HW4: Deadlock and banker's algorithm For each problem in this first section, identify (a) whether the system is currently safe by finding a scheduling sequence that satisfies all possible requests, and if it IS safe, (b) is the specified request safe?... again, find a scheduling sequence that satisfies all possible requests if the current request were granted Sequences MUST favor tasks with smaller identifiers as we did in class. 1) The system has 12 resources. T2 is requesting 1 Task Max Alloc T1 T2 4 ?? T4 9 10 5 2) The system has 25 resources. T1 is requesting 2. Task Max Alloc T1 T2 76 T3 8 T4 8 T6 4 2