(30 XP) Problem 2 Consider summing up the values in a sequence A of n integers, where n is a power of two. Create a new sequence B of half the size of A and set Bli] = A[2i] +A[2i + 1], fori 0,1,.., (n/2) - 1. If B has size 1, then output B[0]. Otherwise, replace A with B, and repeat the process. What is the running time of this algorithm? (30 XP) Problem 2 Consider summing up the values in a sequence A of n integers, where n is a power of two. Create a new sequence B of half the size of A and set Bli] = A[2i] +A[2i + 1], fori 0,1,.., (n/2) - 1. If B has size 1, then output B[0]. Otherwise, replace A with B, and repeat the process. What is the running time of this algorithm