Showing L elementof SD/D L = { : TM M accepts both and aa, taking one more step to accept aa than a}. A step is comprised of the an application o the delta function: (K-H) times Gamma rightarrow K times gamma times {rightarrow, leftarrow} Mapping a non-halting state and a tape symbol to a state, a tape symbol, and moving one square L or Ron the tape. For example, it would take a minimum of 3 steps for a TM to overwrite 3 symbols on the input tape with Construct an algorithm that semidecides L. Prove that L NotElement D using Rice's theorem (sect 21.4, the last section we will cover in this course). Prove that L NotElement D using a reduction from H