conversion of Language from PDA

PDA to language

Based on the given PDA, I think it will always produce equal or less number of bs’ as as’. What I came up with after many trials is L = {a^nb^m; n/2<=m<=n,n>=0}.

Can someone guide me on this and tell me why this is correct or wrong?