Give a CFG for the following language and the corresponding PDA for

All words in the alphabet ={ (,b,) } where

i) the parentheses are balanced

ii)the symbol b can be placed anywhere and for any number of times

iii)There are no 3 consecutives )))

For example these strings belong to language (()()) bbb() and (b)bb((b)bb)

but this don't (bb() (b(b(b)))