Give the state diagram of the Turing machine that accepts the language $|)$:$\}$ is a string over $\{0,1\}**.$

pls explain steps clearly