Question 5 Problem : To Multiply two positive integers x, y only using just + and -operations. Denote the result as z. TA] Design an algorithm using the notation given above to solve this problem, with x, y as input variables, and z as the output variable. [B] Show that this satisfies the finiteness criterion of an algorithm. That is, show that the algorithm will always terminate. [c] what is the worst case time complexity of your algorithm? That is, how good is it? Use the Big O notation to answer. That is, your answer should give the complexity as 'O (some function of the size of the probleml'. D] Give an argument to prove that your algorithm is correct. That is, your algorithm does indeed do what it's supposed to do