Consider the recursion X(n) = 2X(n-1) + 2 with the initial condition that of X(1) = 4. Using math induction prove that a closed-form solution to this recurrence is X(n)=2n +2n+1 – 2.

10 points? ? +++ me asap gabriella uses the current exchange rate to write the function, h(x), where x is the number of u.s. dollars and h(x) is the number of euros, the european union currency. she checks the rate and finds that h(100) = 7.5. which statement best describes what h(100) = 75 signifies? a) gabriella averages 7.5 u.s. dollars for every 100 euros. b) gabriella averages 100 u.s. dollars for every 25 euros. c) gabriella can exchange 75 u.s. dollars for 100 euros. d) gabriella can exchange 100 u.s. dollars for 75 euros.