1. Explain why Dekker's algorithm correctly solves the mutual exclusion problem. Refer to the three requirements for a correct solution to the mutual exclusion problem.
2. Why can't Dekker's algorithm be extended to more than two processes?
3. Mutex locks and condition variables can be used together to implement a semaphore. To show that the combination of mutex locks and condition variables is equivalent to a semaphore, we need to show that semaphores can be used to implement a mutex lock and a condition variable. Show how this can be done.