Turing machine that will double all the & # 39; b & # 39; of all entered strings

I'm trying to build a Turing machine that will double all the "b's" of all the strings entered on {c, d}.
How can I double? B & # 39; in the input string? because i can not replace b by bb because a tape cell can only contain one character.