Question 48 (3 points) - The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows: void enter cs (X) f while (test-and-set (&X)false)) void leave CS (X)( X = 0; } bool test-and-set (int *var) if (var-0) *var-l; return true; else return false; In the above solution, X is a memory location associated with the CS and is initialized to 0. Now consider the following statements: ID S1 S2 S3 S4 Statement The above solution to CS problem is deadlock-free The solution is starvation free The processes enter CS in FIFO order More than one process can enter hame time Which of the above statements is TRUE