Apparently it's something like

1+2+1=4

1+2+3+2+1=9

1+2+3+4+3+2+1=16 but I just haven't figured out to make that functional using recursive functions

PROBLEM 2: Below is a (trivial) C function which returns the square of its parameter (a non-negative integer): unsigned int square(unsigned int n) { return n*n Your job: write a function which also returns ' but with the following constraints: You cannot use the multiplication operator You cannot use the division operator/ You cannot have any loops You cannot add any additional parameters to the function Your function must be self-contained: no helper functions! . You cannot use any globals You cannot use any static variables . You cannot use any "bit twiddling" operations -- no shifts, etc. However . You can use recursion . You can use the '+' and operators