Write SDT for the below CFG that describes all the binary strings $($over the alphabet $\{0,1\})$ whose decimal values are multiples of $4.$ Assume that there can be leading $0$s digits but any input sequence that corresponds to the decimal value zero is not in the language, i$.$e$.0000$ but $00100$ is in the language. S$$ List Tail List $$ List Bit $|$ Bit Bit$1|0$ Tail $$Lead $00$ Lead $$Lead $0|1$