ALGORITHM | Addition of Binary Numbers Suppose a=(ak1,ak2,,a1,a0)2 and u=(uk1,uk2,,u1,u0)2 are the binary representations of decimal numbers a and u. 1. For i=0,1,,k1 perform ai+2ui plus any carry from the i-1-st step. ai+ui+cmad2 PSEUDOCODE | Adding two numbers with base-2 expansions INPUT: a=(ak1,ak2,,a1,a0)2,u=(uk1,uk2,,u1,u0)2 OUTPUT: (sk1,sk2,,s1,s0)2 sum of a+u Program a function binary_add (a,b) that computes the sum of the binary numbers a=(ai1,ai2,,a0)2 and b=(bj1,bj2,,b0)2 using the algorithm discussed in lecture. No credit will be given to functions that employ any other implementation. The function can not use built-in functions that already perform some kind of binary representation or addition of binary numbers. For example, the function implementation can not use the functions bin() or int (a, base =2). The function should satisfy the following: 1. INPUT: - a - a string of the 0's and l's that make up the first binary number. The string may contain spaces. - b - a string of the O's and 1's that make up the first binary number. The string may contain spaces. 2. OUTPUT: - the string of O's and l's that is the result of computing a+b. The string must be separated by spaces into blocks of 4 characters or less, beginning at the end of the string. EXAMPLE: binary_add( ' 101011,11011) '100 0110