Consider a recursive function g(n)g(n)g(n) where g(n)=2⋅g(n−1)−1g(n) = 2 \cdot g(n-1) - 1g(n)=2⋅g(n−1)−1 for n≥1n \ge 1n≥1. If g(0)=5g(0) = 5g(0)=5, what is the value of g(1)g(1)g(1)?
444
999
101010
111111