Consider a system of six processes $P=(P_{1,\text{c}\text{d}\text{o}\text{t}\text{s}},P_6).$

Associated with the system are $6$ memory cells $M=(M_1,$cdots,$M_6).$

The domain and range for each process is given in the following table:

In addition, you are given the following precedence relation:

$=\{(P_1,P_3),(P_1,P_4),(P_2,P_4),(P_1,P_5),(P_4,P_5)\}$

a$)(20$ pts$)$ Construct the Precedence Graph $($not containing amy redundant or transitive edges$)$

b$)(20$ pts$)$ Determine if the system above is always determinate. If it is not, add to $$ necessary elements to

make it determinate.

$(30$ pts$)$ Suppose we are dealing with a system of only $5$ processes named $P_5$ through $P_s.$ You are given a set of

constraints that are expressed by the following precedence relation:

$=\{(P_1,P_4),(P_1,P_5),(P_2,P_1),(P_6,P_5)\}$