QUESTION 1 Question The following function computes the sum of the first n >=1 integers. Show how this function satisfies the properties of a recursive function. Makes sure to cover all 4 properties. Describe how efficient this implementation is compared to its iterative approach for the same problem **Computes the sum of the integers from 1 through n @pre n> e.. @post None.i. Oparam n A positive integer return The sum 12 + n. */ int sumupTo(int n) f int sum 0 if(n=: 1) sum1; else // n > 1 sum n + sunUpTo(n - 1); return sum; / end sumupTo