Pplications of Rec. Relations (2 points) Let n be numbers (where n1 For tal number of ways to write n as the sum of two positive example: Since 9-1 +8 = 2 + 7 1) Find the following: 3+6 = 4+5 it means that f,-4 2) Give a recursive definition of n 5. Program Correctness I (1 point) Use the loop invariant (I) to show that the code below correctly compute 72-1 ?2k + 1 k-0 (this sum represents the sum of the first n odd integers where n Algorithm 1 oddSum (int n) i: p=2(n-1)+1 2:i=n-1 3: while i0 do 4: //(lJP:: ?2k + 1 p=p+2i + 1 7: end while 8: return p Prove the Base case of the loop invariant (I)