For the recurrence relation:

T ( n ) = { 1 , if n = 1 T ( n 1 ) + n , if n > 1

What is the closed form of T ( n ) for n 1

Group of answer choices

n(n+1)/2n(n+1)/2

n2n2

n(2n+1)/3n(2n+1)/3

For the recurrence relation: T(n) = { 1, if n = 1 T(n 1) + n, if n > 1 What is the closed form of T(n) for n > 1 on(n+1)/2 on? on(2n + 1)/3