$(25$pts$)$ Consider the following resource$-$allocation state for a single resource class.

Free: $3$

Given the information above, please answer the following questions:

a$.$ What is the total number of EXISTING resources captured by the above state?

b$.$ Given the above state, which process's request can be satisfied?

c$.$ True$/$False: The above state is considered "Safe".

$($Careful$,$ whether or not the request in $($b$)$ can be satisfied or not does NOT dictate whether

the 'state' as given is "safe"$)$

d$.$ Assuming there is indeed a process in part $($b$)$ above whose request can be satisfied. Which

process' request can be satisfied next?

e$.$ True$/$False: There exists a scheduling order, that allows ALL requests to be satisfied?

$($If 'True', state the order as a comma$-$separated list$)$