Question 5. (2+3 points) Given the following coarse-grained solution to the critical section problem. Answer questions (a) and (b). int x = 1; process cs[i = 1 to n] while (true) { 0) x = x - 1;> ## Csenter Protocol critical section; ## CSexit Protocol noncritical section; } } (a) If the scheduling policy is weakly fair, does the above solution to the critical section problem satisfy the eventual entry property? Justify your answer clearly. (b) Convert the above coarse-grained solution into a fine-grained solution using the Fetch-and-Add instruction defined as follows (note that the value of incr can be negative): FA(var, incr) : In your answer, the cSexit Protocol must be replaced by FA (X, 1). To receive full credits for this question, you must use busy waiting to reduce memory contention and cache invalidation overhead on multiprocessors. Question 5. (2+3 points) Given the following coarse-grained solution to the critical section problem. Answer questions (a) and (b). int x = 1; process cs[i = 1 to n] while (true) { 0) x = x - 1;> ## Csenter Protocol critical section; ## CSexit Protocol noncritical section; } } (a) If the scheduling policy is weakly fair, does the above solution to the critical section problem satisfy the eventual entry property? Justify your answer clearly. (b) Convert the above coarse-grained solution into a fine-grained solution using the Fetch-and-Add instruction defined as follows (note that the value of incr can be negative): FA(var, incr) : In your answer, the cSexit Protocol must be replaced by FA (X, 1). To receive full credits for this question, you must use busy waiting to reduce memory contention and cache invalidation overhead on multiprocessors