5. Recall rom lecture that the proof of the Cook-Levin theore rlis on cecking that every Consider a 2 x 3 windows 2 x 3 window is valid. Suppose that our tape alphabet is 0,1, that looks like 0 Ja where the ?'s represent unknown characters. It happens that we know that when our Turing machine is in state qa and reads a 0, it changes State : WnCn lt IS In Staatc la ancd readds al l, IL Changes to Slalte qc. LlSU all ol tHc Way's We can fill the second row of the window above so that the entire window is valid