In the Banker$$s Algorithm for deadlock avoidance, we define the system as being in a $$safe state$$ if there exists a sequence of all processes in the system such that, for each process, the resources that the process can still request can be satisfied by the currently available resources plus resources held by all the earlier processes in the sequence. $(10$ points$)$ a$.$ As we try to determine this sequence of processes, what do we do if we find a process that has resource needs greater than the available resources? $(5$ points$)$ b$.$ As we try to determine this sequence of processes, what do we do if we find a process that has resource needs less than or equal to the available resources? $(5$ points$)$