For this quesiton only solve question 2, all copied answers will result in a downvote and a report. If the solution is correct i will upvote it and recommend to peers

In the first problem, there were 9 processes, many of which were listed as pairs under the precedence relation. Suppose we are now dealing with a system of only 5 processes named P1 through P5. You are given a set of constraints that are expressed by the following precedence relation: ={(P1,P3),(P1,P5),(P2,P4),(P3,P4),(P4,P5)} ipring 20234320/6320 Section 006 Operating Systems Provide pseudocode for each of those 5 processes to show how you can use semaphores to enforce these constraints (i.e., the precedence relation ). Also, you must initialize these semaphores correctly (15 points). In addition, you are given the following precedence relation: ={(P1,P2),(P1,P6),(P2,P3),(P2,P4),(P2,P5),(P3,P6),(P3,P8),(P4,P6),(P4,P7),(P5,P7),(P5,P8),(P6,P8),(P6,P9),(P7,P9),(P8,P9)} a. Construct the Precedence Graph (not containing any redundant edges; also modify accordingly). Use PowerPoint, diagrams.net, or any other app to draw the graph. (15 points) b. Is the system above determinate for all interpretations of its processes? If it is not, add to necessary elements to make it determinate (no graph drawing needed). Explain all of your reasoning. (20 points)