Consider the Binary Sum Problem : Input : Two arrays of n $-$ bit binary integers $,$ say A and B$.$ Output : An $($ n $+1)-$bit binary summation array $,$ say C$.$ Ex : Let n $=5,$ A $(1\mathrm{.}0,1,1\mathrm{.}0)$ and B $==(0,1,1,0,1).$ Then $,$ the binary summation of A and B is an array C of size n $+1=6.$ The sum array can be given as C $(1,0,0,0,1,1).1.(25$ pts $)$ Let Binary Sum be an algorithm that solves the problem $,$ i$.$e$.,$ adds the two binary integers $.$ Write the pseudocode of the Binary Sum algorithm $.2.(15$ pts $)$ Analyze the time complexity of your algorithm $.$ Give an asymptotic upper bound on the running time of your algorithm $.3.(10$ pts $)$ Is Binary Sum an efficient algorithm $?$ Discuss in detail $.$ D Reply