Four tennis teams happened to come to a tennis center at the same time, requesting rackets to play. However, there are only four rackets available. Using the solution to the Bounded Buffer problem (Ch.5- Slide 31) as an example, design a synchronization solution for these four tennis teams to smoothly share the four rackets? Note: the tennis center is a warehouse with four rackets. Each team must rent two rackets together to begin their tennis games, and return both rackets when they complete. Your solution needs to implement two methods (rent, return), along with a description for the initial conditions

Example: Bounded Buffer Take(){ Add (item) lock.acquire() while (front tail) ( lock.acquire( while ((tail-front)MAX) empty.wait(lock); full.wait (lock); item = buf[ front % MAX]; front++; full.signal (lock); lock.release() return item; buf[tail % MAX) -item ; tail++ empty.signal(lock); lock.release() Initially: front-tail = 0; MAX is buffer capacity full is a condition variable besides empty Chapter 4, S