Discrete mathematics

3 Recursive Algorithm and Induction 1. Give a recursive algorithm that takes as input two non-negative integers x and y and returns their sum, r + y. The only arithmetic operation your algorithm can perform is incrementing an integer value, e.g. r++, and decrementing an integer value, e.g. r-- 2. Use induction to prove that your algorithm always returns a correct answer. 3. State a correct claim about the number of increment and decrement operations your algorithm makes to compute +y and use induction to prove that your claim is correct