deletions | additions       diff --git a/a) Complexity.tex b/a) Complexity.tex  index 22177aa..76ee7bb 100644  --- a/a) Complexity.tex  +++ b/a) Complexity.tex 
...
\begin{align*}  T(n) = \begin{cases}  c_0 & \text{if } n = 0\\  c_1 + \sum_{i \displaystyle\sum_{i  = 0}^{n-1} T(i) & \text{if } n > 0 \end{cases}  \end{align*}  \end{subequations}  $T(n-1), n > 0$ 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: