5. Recall from lecture that the proof of the Cook-Levin theorem relies on checking that every 2 3 window is valid. Suppose that our tape alphabet is {0, 1, . Consider a 2 x 3 windows that looks like 0 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 to state qb; when it is in state ga and reads a 1, it changes to state ge. List all of the ways we can fill the second row of the window above so that the entire window is valid 5. Recall from lecture that the proof of the Cook-Levin theorem relies on checking that every 2 3 window is valid. Suppose that our tape alphabet is {0, 1, . Consider a 2 x 3 windows that looks like 0 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 to state qb; when it is in state ga and reads a 1, it changes to state ge. List all of the ways we can fill the second row of the window above so that the entire window is valid