Consider the following snapshot of a system: T1 T2 T3 Allocation ABCD 3014 2210 3121 0510 4212 Max ABCD 5117 3211 3321 4612 6325 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)