Engineering
In the first problem, there were 9 processes, many of which were listed as pairs under the precedence relation. Suppose we are 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)} Provide pseudocode to show how you can use semaphores to enforce these constraints (i.e., the precedence relation ).
On an online recruiting platform, each recruiting company can make a request for their candidates tocomplete a personalized skill assessment. The assessment can contain tasks in three categories: SQL,Algo and BugFixing. Following the assessment, the company receives a report containing, for eachcandidate, their declared years of experience (an integer between 0 and 100) and their score in eachcategory. The score is the number of points from 0 to 100, or NULL, which means there was no task inthis category.You are given a table, assessments, with the following structure:create table assessments (id integer not null,experience integer not null,Helsql integer,algo integer,bug fixing integer,unique(id)Your task is to write an SQL query that, for each different length of experience, counts the number ofcandidates with precisely that amount of experience and how many of them got a perfect score in eachcategory in which they were requested to solve tasks (so a NULL score is here treated as a perfectscore).Your query should return a table containing the following columns: exp (each candidate's years ofexperience), max (number of assessments achieving the maximum score), count (total number ofassessments). Rows should be ordered by decreasing exp.Examples:1. Given:assessments: