deletions | additions       diff --git a/a) Complexity.tex b/a) Complexity.tex  index 76ee7bb..5594a61 100644  --- a/a) Complexity.tex  +++ b/a) Complexity.tex 
...
T(n) &= c_1 + \sum_{i = 0}^{n-2} T(i) + T(n-1)\\  &= 2T(n-1)  \end{align*}  \end{subequations} Thus we get:  \begin{subequations}  \begin{align*}  T(n) = \begin{cases}  c_0 & \text{if } n = 0\\  2^{n-1}(c_0 + c_1) & \text{if } n > 0  \end{cases}  \end{align*}  \end{subequations}