Question.no.1: Explain in this Resource Allocation Graph with table there are these condition is existing or not. I. Deadlock exist or not. II. Circular wait. III. Hold and wait IV. What type of graph Question .No 2: Consider the environment where many user-level threads are mapped to a single kernel thread (i.e., the many-to-one model). Describe a situation the one-to-one model outperforms this model. Question .No 3: In synchronization unit Describe in Detail what is? I. Semaphore II. Peterson solution III. Explain: Race conditions, Question .No 4: Please list two disadvantages of a monolithic operating system structure and two advantages of microkernel operating system structure. Question .No 5: What are two levels of Linux authorization? Question .No 6: What is Semaphore? Give the implementation of Bounded Buffer Producer ConsumerProblem using Semaphore. Question .No 7: Five batch jobs A to E arrive at same time. They have estimated running times 10,6,2,4 and 8 minutes. Their priorities are 3,5,2,1 and 4 respectively with 5 being highest priority. For each of the following algorithm determine mean process turnaround tim swapping overhead. Round Robin, Priority Scheduling