Q2 (6 Points): Consider the following snapshot of a system: Allocation Max AB CD ABCD 3014 5117 T1 2210 3211 T2 3121 3 3 2 1 T 0510 4612 T4 4212 63 2 5 Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the threads may complete. Otherwise, illustrate why the state is unsafe. a. Available = (0,3,0,1) b. Available = (1, 0, 0, 2)