Create a TM that takes a list of binary numbers and identifies the start of the shortest number $($only in terms of length$).$ You can assume that each number has at least one bit in it$.$

The program should return the input back to normal with a $ in the front of the shortest string.

E$.$g$.$

Input: #$10101$#$1101$#$110$#$001$#$101111$#

Output: #$10101$#$1101$$$110$#$001$#$101111$#

$-$ with machine stopping at the $ symbol.

This is what I have right now: It takes the input and marks off the first symbol of each number and then rewinds to the beginning. Please finish the TM$.$