$\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}$using recursion'$\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}\text{'}$

a$.$ is$\_$balanced$($binary$\_$number$)(10$ marks$)$

This function should return True if the input string of $0\text{'}$s and $1\text{'}$s contains the same

number of $\text{'}{?}^{\text{'}}$ s and $1\text{'}$s and False otherwise.

b$.$ reorder$($numbers$)(10$ marks$)$

This function should reorder the given list of $0\text{'}$s and $1\text{'}$s into a new list so that all $0\text{'}$s

ceme before all $1\text{'}$s$.$ The function must not change the given argument $($numbers$).$