Answer all please.

Question 1. Race conditions are possible in many computer systems. Consider a banking system with two methods: deposit(amount) and withdraw(amount). These two methods are passed the amount that is to be deposited or withdrawn from a bank account. Assume that a husband and wife share a bank account and that concurrently the husband calls the withdraw method and the wife calls deposit0. Describe how a race condition is possible and what might be done to prevent the race condition from occurring Question 2. Servers can be designed to limit the number of open connections. For example, a server may wish to have only N socket connections at any point in time. As soon as N connections are made, the server will not accept another incoming connection until an existing connection is released. Explain how semaphores can be used by a server to limit the number of concurrent connections. Question 3. Please define what is Dispatch Latency Question 4. Given following four processes with the arrival time and the expected next CPU burst time in milliseconds, please1) Draw Gantt chart illustrating the execution of processes and 2) Calculate average waiting time. Suppose that this system uses Preemptive Shortest Job First algorithm. Arrival Time Burst Time rocess 0.0 2.0 4.0 6.0 4