deletions | additions       diff --git a/a) Complexity.tex b/a) Complexity.tex  index 148f2ca..58c7661 100644  --- a/a) Complexity.tex  +++ b/a) Complexity.tex 
...
\end{subequations}  $T(n-1)$ is, using the recursive definition above:  \[T(n-1) &= =  c_1 + \sum_{i = 0}^{n-2} T(i)\] Using this, we expand $T(n)$ and get: