A system has four processes and five allocatable resource types. Consider the following state:$$ R$1$ R$2$ R$3$ R$4$ R$5$ P$195555$ P$222330$ P$343320$ P$444444$ Claim Matrix $$ R$1$ R$2$ R$3$ R$4$ R$5$ P$120212$ P$201110$ P$341020$ P$411001$ Allocation Matrix$$ R$1$ R$2$ R$3$ R$4$ R$51569105$ Resource Vector $$ R$1$ R$2$ R$3$ R$4$ R$583662$ Available Vectora$)$ Is this a safe state? Justify your answer by applying the Banker$$s Algorithm. If your answer is yes, show a sequence of process executions and how the available vector changes after each execution. If your answer is no$,$ is this state deadlocked, or is there a way to arrive at a safe state?