Which statement about the red$-$black tree prepare$-$for$-$removal algorithm is not true?

a$.$ If a case's condition is true then that case changes the tree

b$.$ A case may recursively invoke the prepare$-$for$-$removal algorithm

c$.$ A single case may recolor nodes and perform a rotation

d$.$ More than one case may execute