deletions | additions       diff --git a/a) Function.tex b/a) Function.tex  index c3dc7a9..9739470 100644  --- a/a) Function.tex  +++ b/a) Function.tex 
...
\begin{subequations}  \begin{align*}  T(0, x) &= c_A\\  T(i, 0) &= C_A c_A  + C_B\\ c_B\\  T(i, x) &= c_0 \sum_{a=0}^{x} \left[ c_1 + T(i-1, x-a) \right]  \end{align*}  \end{subequations}\subsection{Dynamic programming}  \begin{verbatim}  function maxReturn(i, x) begin  initialise mem to -1  return mr(i, x)  end  function mr(i, x) begin  if i = 0 then  return 0  end  if (mem[i][x] < 0) then  let m = 0  for a in [0, x] loop  let m = max(m, g(i, a) + mr(i - 1, x - a))  end  let mem[i][x] = m  end  return mem[i][x]  end  \end{verbatim}