The Fibonacci sequence is defined by $b_n = b_{n-1} + b_{n-2}$ with $b_1 = 1, b_2 = 1$. If computed naively using only the recurrence (no memoization), how many additions are performed to compute $b_7$?