5. [X points) Below is the recurrence for Factorial, and an incomplete substitution. Please fill in the blank lines to complete this substitution. Don't forget to substitute (1) with c or 1. (1) if n=0 or 1 T(n)= (T(n-1)+O(1) if n>1 To help you get started , see below T(n)= T(n-1)+ T(n)= T(n-2)+ T(n)= T(n-3)+ T(n)= T(n-4)+ Write down T(n) After k iterations : T(n)=. Define k in terms of n: k= Show the base case: T(n)= Conclude T(n)= (