wish$).$ Note that $\backslash$$ is a lambda transition in this text representation.

$```$

#states

A

B

C

D

E

#initial

A

#accepting

E

#alphabet

$0$

$1$

#transitions

A:$$>$B

B:$0>$C

C:$1>$C

C:$0>$D

B:$1>$D

D:$$>$E

$```$

If State $\backslash ($ C $\backslash )$ is removed next, a single transition from B to $\backslash ($ D $\backslash )$ results, what will be the label on the transition from $\backslash ($ B $\backslash )$ to $\backslash ($ D $\backslash )?$ Write your answer without any spaces or parentheses.