Find the flaw in the following recurrence relation solutions and then write out the correct solution. If no flaw exists write "No flaw".

T (n) = T (n-1) + n T (n) = T (n-2) n when k = 1 when 2 when k 3 (n-1) y i=n-k+1 T (n) = T (n-k) + when k k If T (00 Plug k = n into the T (n) equation when k = k. T (n) = T (0) + i T (n) = n (n + 1) (2n + 1) 6