Bounded waiting is satisfied because they have used counting semaphores so everytime a request is made to enter into CS and if there is some other process in CS then the process will get added into a waiting queue.
so according to bounded waiting.
There exists a bound, or limit, on the number of times other processes are allowed to enter their critical sections after a process has made request to enter its critical section and before that request is granted.
As the processes are in a queue they will enter the CS in that order.Hence this condition will be satisfied.