Maekawa's Algorithm is used to achieve mutual exclusion for 13 sites. Suppose the sites are labeled 1, 2, ..., 13. Find the request sets R1, R2, ... , R13. Suppose sites 1, 6, 12 want to enter a critical section ( CS ) and they have sent requests in the order 1, 6, 12. The following sequence of events have occurred in the order listed: 1. The requests of site 1 have arrived at site 2, and site 3. Its request to site 4 is on the way. 2. The requests of site 6 have arrived at site 9, and site 12. Its request to site 2 is on the way. 23. The requests of site 12 have arrived at site 4, and site 7 and 8. Draw a diagram to show which sites have been locked and locked by whom. Suppose the transit requests have arrived at their destinations. At this point can any site enter the CS? Why? If not, how do the sites resolve the problem?