A distributed system doesn't support preemptive process migration facility. To design a load sharing algorithm for scheduling of process in this system, which policy is ideal for this scenario? Justify your answer. $[10]$

Q$5.$ Suppose we are trying to implement Transaction$-$based deadlock prevention method and there are three transactions Ti$,$ Tj & Tk$.$ Ti is the oldest Tk is the youngest transaction. What happens to Ti$,$ Tj & Tk if we were to implement the following two methods?

a$)$ Wait$-$die scheme

b$)$ Wait$-$wound scheme