Consider the following recursive algorithm: ALGORITHM C(n) if n = 1 return 1 else return C(n-1) + n *n*n () n The recurrence relation for the number of times the algorithm's basic operation multiplication Man) is executed, will be: A) M(n) = M(n - 1) + n3, M(1) = 1 B) M(n) = M(n-1) + 2, M(1) = 0 C M(n) = M(n - 1) + 2, M(1) = 1 D M(n) = M(n-1) + n), M(1) = 0