Consider the sequence starting with 0,0,1,3,6, 10, 15,21,28,36,45,... (a) Give a recursive definition for the sequence, which includes the basis step and the recursive step, for n=0,1,2,3,...; (b) Design a recursive algorithm in pseudocode to find the nth term of the sequence. (c) Give the time complexity of the above recursive algorithm