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