Lab$9$ Problem to solve

$$ Convert a binary number to the corresponding base ten

representation

$$ Implement an input validation loop to verify that the input contains all

valid binary chars $($i$.$e$.$ all are zero or $1)$

$$ Note that this is essentially the same problem that was solved in Lab$3$

$$ However, when you completed Lab$3,$ you had not yet been introduced to

loops, so you had to specify, in advance, the number of chars in the binary

number

$$ Now that you know loops, the input string can be of a length not previously

specified

$$ We can determine the number of chars with the length$()$ method

$$ We can then use a for loop to solve the problem