Show that the following languages are undecidable:

D $=\{$M$|$M is a Turing machine and M never overwrites a non$-$blank symbol with the blank symbol on any input$\}.$

E $=\{$M$,$ q$|$M is a Turing machine and M never enters the state q on any input$\}$