Do all questions

Title: Homework # 4 (Covers chapter 5 and 6). Due Data: Tuesday, 7/8/2018 (Submitted it in the class time) Question 1 What mutex locks are used for? Question 2: What do we mean by semaphore? What it types? Question 3 Explain in your own words, the deadlock and starvation problems Question 4 What are the scheduling criteria? Question 5: Suppose that the processes arrive in the order: P2, P3, P1, and P4 as in this table: Process P1 P2 P3 P4 Burst Time 25 a) b) c) Calculate waiting time and average waiting time in case, we are using the First Come, First-Served (FCFS) scheduling. Calculate waiting time and average waiting time in case, we are using the Shortest-Job-First (SJF) scheduling. Which of the FCFS or SJF scheduling is better in this case