1. Draw the resultant Resource-Allocation Graph 2. Provide the Request Edges 3. Provide the Assignment Edges 4. Provide the Cycles (if any), if there are no cycles you need to clearly state this 5. Provide which processes are deadlocked (if any), if no processes are deadlocked clearly state this. In either case, clearly explain why this is the case. Table 1 Bankers Algorithm Given Table 2 1. Complete the Max Table 2. Complete the Allocated Table 3. Complete the Need Table 4. Complete the Available Table 5. Complete the Safety Algorithm