How to satisfy bounded waiting in case of deadlock?
You are correct.

Consider the simple synchronization algorithm which denies entry to all processes. 

In this case we have both deadlock and bounded waiting, since any process $p$ is not bypassed by some process $p'$ before entering the critical section, so you could say bounded waiting is satisfied with the constant function $f=0$.