1. (6 pts) consider the following snapshot of a system: allocation max available a b c d a b c d a b c d t0 3 1 4 1 6 4 7 3 2 2 2 4 t1 2 1 0 2 4 2 3 2 t2 2 4 1 3 2 5 3 3 t3 4 1 1 0 6 3 3 2 t4 2 2 2 1 5 6 7 5 answer the following questions using the banker’s algorithm: a. illustrate that the system is in a safe state by demonstrating an order in which the threads may complete. otherwise, illustrate why the state is unsafe. b. if a request from thread t4 arrives for (0, 1, 1, 0), can the request be granted immediately? c. if a request from thread t3 arrives for (1, 2, 1, 2), can the request be granted immediately?