Compare which code runs fasterdef binary$\_$to$\_$decimal$\_$v$1($binary$\_$str$)$:

k $=$ len$($binary$\_$str$)$

decimal $=0$ # initialization

for i in range$($k$)$: # iteration

decimal $+=2**$i $*(1$ if binary$\_$str$[($k $-1)-$ i$]=="1"$ else $0)$

return decimaldef binary$\_$to$\_$decimal$\_$v$2($binary$\_$str$)$:

decimal $=0$ # initialization

for bit in binary$\_$str:

decimal $=$ decimal $*2+(1$ if bit $=="1"$ else $0)$ # iteration

return decimal