WILL GIVE BRAINLIEST!!! 12 POINTS!!!
Express the sequence given below as a recursively-defined function.
3, 11, 27, 59, 123
*u(0) = 3
u(n + 1) = u(n) + 8
for n = 0, 1, 2, ...
*u(0) = 3
u(n + 1) = 2u(n) + 5
for n = 0, 1, 2, ...
*u(0) = 3
u(n + 1) = 3u(n) + 2
for n = 0, 1, 2, ...
*u(0) = 3
u(n + 1) = 8u(n) + 1
for n = 0, 1, 2, ...
