We saw earlier the following theorem on the bounds of shared memory for mutual exclusion: Any deadlock$-$free mutual exclusion algorithm for n threads must use at least n shared registers. For this exercise, we examine a new algorithm that shows that the space lower bound of the above theorem is tight. Specifically, we will show the following: