Exereise $($HANDIN $3)$: Consider the following "implementation$-$level" description of an algorithm, with $=\{0,1\}$

$"$On input $$

If $w=,$ reject.

If $w$ starts with $0,$ reject. Otherwise, replace the first bit $($I$)$ with a "markedp $1($i$).$

Scan to the end of the tape.

Repeate

Look at the rightmost bit.

If it is $0,$ replace it with a blank and movelleft.

Ifitis $1,$ reject.

If we get to the beginning of the tape $($look for the dotted symbol$),$ accept"

Answer the following:

Does this algorithm aceept or relect $w=101000?$

Suppose whas length $n.$ What is the running time of this alsorithminterms of in$?$