04 Jul evaluate the following scheduling algorithms and states

You are requested to evaluate the following scheduling algorithms and states which could result in starvation? Explain why, by providing a situation that might lead to starvation? a) First-come, first-served b) Shortest job first c) Round robin d) Priority Question 2: Servers are designed to limit the number accepted open connections. For instance, a server may have only N socket connections at any point in time. Once the N connections are established, the server will no longer accept another incoming connection until an existing connection is terminated. Explain how semaphores can be applied by a server to control the number of control on the number of accpeted connections (assuming that the semaphores uses the methods acquire() and release().) Question 3: What would the consequences, if the wait() and signal() semaphore operations are not executed atomically, to mutual exclusion. Describe a situation where multiple processes are invoking concurrently the methods wait() (which do not run in atomic fashion);