Having trouble with a context free grammar construction

How should the following language be constructed with a CFG?

L = {x ∈ {a, b}* | x is a palindrome and the number of b’s in x is divisible by 3}.
I feel like I’m getting close, but I find something wrong with my answer every time. Any help would be great.
Thank you :slight_smile: